Random Flow in Queueing Networks: A Review and Critique
- 1 September 1975
- journal article
- review article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 7 (3) , 268-288
- https://doi.org/10.1080/05695557508975009
Abstract
This paper introduces basic properties of queueing networks. Networks are classified by their queue length vector processes as being Markov processes or not. In each case the relevant problems are exposed and the literature of each problem is surveyed. The paper concludes with a discussion of the results, and some points in need of further research are established.Keywords
This publication has 78 references indexed in Scilit:
- A Generalized Multi-Entrance Time-Sharing Priority QueueJournal of the ACM, 1975
- Synthesis of a Feedback Queueing Discipline for Computer OperationJournal of the ACM, 1974
- A single-server queueing system with a finite number of demandsCybernetics and Systems Analysis, 1974
- Characterization for the queueing system M/G/∞Mathematical Proceedings of the Cambridge Philosophical Society, 1973
- A bivariate Poisson queueing process that is not infinitely divisibleMathematical Proceedings of the Cambridge Philosophical Society, 1972
- A Survey of Analytical Time-Sharing ModelsACM Computing Surveys, 1969
- Markov population processesJournal of Applied Probability, 1969
- Markov renewal theoryAdvances in Applied Probability, 1969
- Queues with time-dependent arrival rates I—the transition through saturationJournal of Applied Probability, 1968
- DECOMPOSITION OF A SEMI‐MARKOV PROCESS UNDER A MARKOVIAN RULEAustralian Journal of Statistics, 1966