Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-06-05T08:04:50.900Z Has data issue: false hasContentIssue false
  • English
  • Français

Networks of queues and the method of stages

Published online by Cambridge University Press:  01 July 2016

Andrew D. Barbour
Andrew D. Barbour*
Affiliation:
University of Cambridge
Get access Rights & Permissions [Opens in a new window]

Abstract

In a recent article, Kelly [4] has been able to exhibit interesting equilibrium properties for a wide class of ‘quasi-reversible’ queue networks. The assumption of quasi-reversibility puts restrictions on queue discipline, but not on the distributions of the service requirements of customers: however, because of the method of proof he employed, Kelly was forced to impose the condition that the service requirements were finite mixtures of gamma distributions. The form of the results he obtained led him to conjecture that this condition was in fact unnecessary, as is shown to be the case in this paper. The method used to prove the conjecture is of potentially wide application, in problems where the ‘method of stages' leads to useful simplification.

Keywords

CONTINUITY OF QUEUESMETHOD OF STAGESNETWORKS OF QUEUESREVERSIBILITY
Type
Research Article
Information
Advances in Applied Probability , Volume 8 , Issue 3 , September 1976 , pp. 584 - 591
Copyright
Copyright © Applied Probability Trust 1976 

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] Baskett, F. et al. (1975) Open, closed and mixed networks of queues with different classes of customers. J. Ass. Comp. Mach. 22, 248–260.Google Scholar
[2] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[3] Breiman, L. (1968) Probability. Addison-Wesley, Reading, Mass. Google Scholar
[4] Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8,CrossRefGoogle Scholar
[5] Kennedy, D. P. (1972) The continuity of the single-server queue. J. Appl. Prob. 9, 370–381.Google Scholar
[6] Kingman, J. F. C. (1963) Ergodic properties of continuous-time Markov processes and their discrete skeletons. Proc. Lond. Math. Soc. (3) 13, 593–604.Google Scholar
[7] Reiser, M. and Kobayashi, H. (1975) Queueing networks with multiple closed chains: theory and computational algorithms. IBM J. Res. Develop. 19, 283–294.CrossRefGoogle Scholar
[8] Skorohod, A. V. (1956) Limit theorems for stochastic processes. Theor. Prob. Appl. 1, 261–290.CrossRefGoogle Scholar
[9] Whitt, W. (1974) The continuity of queues. Adv. Appl. Prob. 6, 175–183.CrossRefGoogle Scholar