NON-ERGODIC JACKSON NETWORK.

Jonathan B. Goodman; William A. Massey

doi:10.1017/S0021900200037554

NON-ERGODIC JACKSON NETWORK.

Jonathan B. Goodman
, William A. Massey

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

Abstract

The authors generalize Jackson's theorem to the non-ergodic case. Here, despite the fact that the entire Jackson network will not achieve steady state, it is still possible to determine the maximal subnetwork that does. They do so by formulating and algorithmically solving a new non-linear throughput equation. These results, together with the ergodic results and the ones for closed networks, completely characterize the large-time behavior of any Jackson network.

Original language	English (US)
Pages (from-to)	860-869
Number of pages	10
Journal	Journal of Applied Probability
Volume	21
Issue number	4
DOIs	https://doi.org/10.1017/S0021900200037554
State	Published - 1984
Externally published	Yes

All Science Journal Classification (ASJC) codes

Statistics and Probability
General Mathematics
Statistics, Probability and Uncertainty

Access to Document

10.1017/S0021900200037554

Cite this

@article{2b556fbaac614cef9ba767dce873d103,

title = "NON-ERGODIC JACKSON NETWORK.",

abstract = "The authors generalize Jackson's theorem to the non-ergodic case. Here, despite the fact that the entire Jackson network will not achieve steady state, it is still possible to determine the maximal subnetwork that does. They do so by formulating and algorithmically solving a new non-linear throughput equation. These results, together with the ergodic results and the ones for closed networks, completely characterize the large-time behavior of any Jackson network.",

author = "Goodman, \{Jonathan B.\} and Massey, \{William A.\}",

year = "1984",

doi = "10.1017/S0021900200037554",

language = "English (US)",

volume = "21",

pages = "860--869",

journal = "Journal of Applied Probability",

issn = "0021-9002",

publisher = "Cambridge University Press",

number = "4",

}

TY - JOUR

T1 - NON-ERGODIC JACKSON NETWORK.

AU - Goodman, Jonathan B.

AU - Massey, William A.

PY - 1984

Y1 - 1984

N2 - The authors generalize Jackson's theorem to the non-ergodic case. Here, despite the fact that the entire Jackson network will not achieve steady state, it is still possible to determine the maximal subnetwork that does. They do so by formulating and algorithmically solving a new non-linear throughput equation. These results, together with the ergodic results and the ones for closed networks, completely characterize the large-time behavior of any Jackson network.

AB - The authors generalize Jackson's theorem to the non-ergodic case. Here, despite the fact that the entire Jackson network will not achieve steady state, it is still possible to determine the maximal subnetwork that does. They do so by formulating and algorithmically solving a new non-linear throughput equation. These results, together with the ergodic results and the ones for closed networks, completely characterize the large-time behavior of any Jackson network.

UR - https://www.scopus.com/pages/publications/0021606643

UR - https://www.scopus.com/pages/publications/0021606643#tab=citedBy

U2 - 10.1017/S0021900200037554

DO - 10.1017/S0021900200037554

M3 - Article

AN - SCOPUS:0021606643

SN - 0021-9002

VL - 21

SP - 860

EP - 869

JO - Journal of Applied Probability

JF - Journal of Applied Probability

IS - 4

ER -

NON-ERGODIC JACKSON NETWORK.

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this