Hostname: page-component-6766d58669-76mfw Total loading time: 0 Render date: 2026-05-21T23:27:02.636Z Has data issue: false hasContentIssue false
  • English
  • Français

The non-ergodic Jackson network

Published online by Cambridge University Press:  14 July 2016

Jonathan B. Goodman  and
William A. Massey
Jonathan B. Goodman*
Affiliation:
Courant Institute of Mathematical Sciences
William A. Massey*
Affiliation:
AT&T Bell Laboratories
*
∗ Postal address: Courant Institute of Mathematical Sciences, New York, NY 10012, USA.
∗∗ Postal address: AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

We 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. We 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.

Keywords

NETWORKS OF QUEUESASYMPTOTIC BEHAVIOURSTOCHASTIC DOMINANCENEW THROUGHPUT EQUATION

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 21 , Issue 4 , December 1984 , pp. 860 - 869
Copyright
Copyright © Applied Probability Trust 1984 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Burke, P. J. (1956) The output of a queueing system. Operat. Res. 4, 699–704.CrossRefGoogle Scholar
[2] Gordon, W. J. and Newell, G. F. (1967) Closed queueing systems with exponential servers. Operat. Res. 15, 254–265.CrossRefGoogle Scholar
[3] Jackson, J. R. (1957) Networks of waiting lines. Operat. Res. 5, 518–521.CrossRefGoogle Scholar
[4] Keilson, J. and Kester, A. (1977) Monotone matrices and monotone Markov processes. Stoch. Proc. Appl. 5, 231–241.Google Scholar
[5] Kirstein, B. M., Franken, P. and Stoyan, D. (1977) Comparability and monotonicity of Markov processes. Theory Prob. Appl. 22, 40–52.CrossRefGoogle Scholar
[6] Massey, W. A. (1981) Non-Stationary Queues. Ph.D. Dissertation, Department of Mathematics, Stanford University.Google Scholar
[7] Schweitzer, P. J. (1981) Bottleneck determination. Applied Probability—Computer Science: The Interface, ed. Disney, R. L. and Ott, T. J., Birkhauser, Boston, 1, 471–485.Google Scholar