NON-ERGODIC JACKSON NETWORK.

Jonathan Goodman, William A. Massey

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)860-869
Number of pages10
JournalJournal of Applied Probability
Volume21
Issue number4
StatePublished - Dec 1984

Fingerprint

Jackson Networks
Large Time Behavior
Throughput
Entire
Closed
Generalise
Theorem

ASJC Scopus subject areas

  • Mathematics(all)
  • Statistics and Probability

Cite this

Goodman, J., & Massey, W. A. (1984). NON-ERGODIC JACKSON NETWORK. Journal of Applied Probability, 21(4), 860-869.

NON-ERGODIC JACKSON NETWORK. / Goodman, Jonathan; Massey, William A.

In: Journal of Applied Probability, Vol. 21, No. 4, 12.1984, p. 860-869.

Research output: Contribution to journalArticle

Goodman, J & Massey, WA 1984, 'NON-ERGODIC JACKSON NETWORK.', Journal of Applied Probability, vol. 21, no. 4, pp. 860-869.
Goodman J, Massey WA. NON-ERGODIC JACKSON NETWORK. Journal of Applied Probability. 1984 Dec;21(4):860-869.
Goodman, Jonathan ; Massey, William A. / NON-ERGODIC JACKSON NETWORK. In: Journal of Applied Probability. 1984 ; Vol. 21, No. 4. pp. 860-869.
@article{d57268fbc98c446fa2c37bfc380af0f2,
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 = "Jonathan Goodman and Massey, {William A.}",
year = "1984",
month = "12",
language = "English (US)",
volume = "21",
pages = "860--869",
journal = "Journal of Applied Probability",
issn = "0021-9002",
publisher = "University of Sheffield",
number = "4",

}

TY - JOUR

T1 - NON-ERGODIC JACKSON NETWORK.

AU - Goodman, Jonathan

AU - Massey, William A.

PY - 1984/12

Y1 - 1984/12

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 - http://www.scopus.com/inward/record.url?scp=0021606643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021606643&partnerID=8YFLogxK

M3 - Article

VL - 21

SP - 860

EP - 869

JO - Journal of Applied Probability

JF - Journal of Applied Probability

SN - 0021-9002

IS - 4

ER -