Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-28T01:20:29.706Z Has data issue: false hasContentIssue false
  • English
  • Français

An operator-analytic approach to the Jackson network

Published online by Cambridge University Press:  14 July 2016

William A. Massey
William A. Massey*
Affiliation:
AT&T Bell Laboratories
*
∗ Postal address: AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

Operator methods are used in this paper to systematically analyze the behavior of the Jackson network. Here, we consider rarely treated issues such as the transient behavior, and arbitrary subnetworks of the total system. By deriving the equations that govern an arbitrary subnetwork, we can see how the mean and variance for the queue length of one node as well as the covariance for two nodes vary in time.

We can estimate the transient behavior by deriving a stochastic upper bound for the joint distribution of the network in terms of a judicious choice of independent M/M/1 queue-length processes. The bound we derive is one that cannot be derived by a sample-path ordering of the two processes. Moreover, we can stochastically bound from below the process for the total number of customers in the network by an M/M/1 system also. These results allow us to approximate the network by the known transient distribution of the M/M/1 queue. The bounds are tight asymptotically for large-time behavior when every node exceeds heavy-traffic conditions.

Keywords

STOCHASTIC ORDERINGTRANSIENT BEHAVIORTENSOR REPRESENTATIONSUBNETWORKS
Type
Research Papers
Information
Journal of Applied Probability , Volume 21 , Issue 2 , June 1984 , pp. 379 - 393
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.)

References

[1] Gross, D. and Harris, C. M. (1974) Fundamentals of Queueing Theory. Wiley, New York.Google Scholar
[2] Jackson, J. R. (1957) Networks of waiting lines. Operat. Res. 5, 518–521.Google Scholar
[3] Kamae, T., Krengel, V. and O'brien, G. L. (1977) Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899–912.Google Scholar
[4] Keilson, J. and Kester, A. (1977) Monotone matrices and monotone Markov processes. Stoch. Proc. Appl. 5, 231–241.Google Scholar
[5] Massey, W. A. (1984) Asymptotic analysis of M (t) /M (t)/1: the time-dependent M/M/1 queue. Math. Operat. Res. To appear.Google Scholar
[6] Massey, W. A. (1984) Open networks of queues: their algebraic structure and estimating their transient behaviour. Adv. Appl. Prob. 16, 176–201.Google Scholar