Networks of queues and the method of stages
- 1 June 1976
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 8 (03) , 584-591
- https://doi.org/10.1017/s0001867800042415
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
This publication has 5 references indexed in Scilit:
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- The continuity of queuesAdvances in Applied Probability, 1974
- The continuity of the single server queueJournal of Applied Probability, 1972
- Limit Theorems for Stochastic ProcessesTheory of Probability and Its Applications, 1956