Queueing Networks: A Survey of Their Random Processes
- 1 September 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 27 (3) , 335-403
- https://doi.org/10.1137/1027109
Abstract
In this paper we review three topics in queueing network theory: queue length processes, sojourn times, and flow processes. In the discussion of the queue length processes we present results for the continuous-time process and several embedded processes. Then we compare continuous-time processes with embedded processes. In considerable generality we present results for mean sojourn times and discuss the distributions of sojourn times. In the discussion of flow processes we present results for various queueing systems. Our bibliography of over 300 references, while not exhaustive, does cover the major papers for the topics considered.Keywords
This publication has 184 references indexed in Scilit:
- The Time for a Round Trip in a Cycle of Exponential QueuesJournal of the ACM, 1983
- A Queueing Network Analysis of Computer Communication Networks with Window Flow ControlIEEE Transactions on Communications, 1979
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- The departure process from a queueing systemMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- A Feedback Queueing System With Batch Arrivals, Bulk Service, and Queue-Dependent Service TimeJournal of the ACM, 1970
- DECOMPOSITION OF A SEMI‐MARKOV PROCESS UNDER A MARKOVIAN RULEAustralian Journal of Statistics, 1966
- CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1Australian Journal of Statistics, 1965
- The Dependence of Delays in Tandem QueuesThe Annals of Mathematical Statistics, 1964
- Ergodocity of Queues in SeriesThe Annals of Mathematical Statistics, 1960