Weak convergence in queueing theory
- 1 December 1973
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 5 (3), 570-594
- https://doi.org/10.2307/1425835
Abstract
In the last ten years the theory of weak convergence of probability measures has been used extensively in studying the models of applied probability. By far the greatest consumer of weak convergence has been the area of queueing theory. This survey paper represents an attempt to summarize the experience in queueing theory with the hope that it will prove helpful in other areas of applied probability. The paper is organized into the following sections: queues in light traffic, queues in heavy traffic, queues with a large number of servers, continuity of queues, rates of convergence, and special queueing models.Keywords
This publication has 35 references indexed in Scilit:
- Extreme Values in the GI/G/1 QueueThe Annals of Mathematical Statistics, 1972
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971
- On the Waiting Time in the Queuing System GI/G/1The Annals of Mathematical Statistics, 1970
- Multiple channel queues in heavy traffic. II: sequences, networks, and batchesAdvances in Applied Probability, 1970
- On Extended Rate of Convergence Results for the Invariance PrincipleThe Annals of Mathematical Statistics, 1969
- On limit laws for service processes in multi-channel systemsSiberian Mathematical Journal, 1967
- Some Invariance Principles for Functionals of a Markov ChainThe Annals of Mathematical Statistics, 1967
- On Extreme Order StatisticsThe Annals of Mathematical Statistics, 1964
- On the Characteristics of the General Queueing Process, with Applications to Random WalkThe Annals of Mathematical Statistics, 1956
- On the theory of queues with many serversTransactions of the American Mathematical Society, 1955