Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-29T18:16:07.510Z Has data issue: false hasContentIssue false
  • English
  • Français

Weak convergence in queueing theory

Published online by Cambridge University Press:  01 July 2016

Donald L. Iglehart
Donald L. Iglehart*
Affiliation:
Stanford University
Get access Rights & Permissions [Opens in a new window]

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

CONTINUITY OF QUEUESDIFFUSION APPROMIXATIONSFUNCTIONAL CENTRAL LIMIT THEOREMSINVARIANCE PRINCIPLEQUEUEING THEORYQUEUES IN HEAVY TRAFFICQUEUES IN LIGHT TRAFFICQUEUES WITH MANY SERVERSWEAK CONVERGENCE
Type
Research Article
Information
Advances in Applied Probability , Volume 5 , Issue 3 , December 1973 , pp. 570 - 594
Copyright
Copyright © Applied Probability Trust 1973 

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] Billingsley, P. (1968) Convergence of Probability Measures. John Wiley, New York.Google Scholar
[2] Borovkov, A. A. (1965) Some limit theorems in the theory of mass service. II. Theor. Probability Appl. 10, 375–400. (English translation.)Google Scholar
[3] Borovkov, A. A. (1967) On limit laws for service processes in multi-channel systems. Siberia J. Math. 8, 746–763. (English translation.)Google Scholar
[4] Chung, K. L. (1960) Markov Chains with Stationary Transition Probabilities. Springer-Verlag, Berlin.Google Scholar
[5] Chung, K. L. (1968) A Course in Probability Theory. Harcourt, Brace and World, New York.Google Scholar
[6] Crane, M. A. (1971) Limit theorems for queues in transportation systems. , Stanford University, Technical Report No. 16, Department of Operations Research, Stanford University.Google Scholar
[7] Daley, D. J. (1968) The serial correlation coefficients of waiting times in a stationary single server queue. J. Austral. Math. Soc. 8, 683–699.Google Scholar
[8] Doeblin, W. (1938) Sur deux problèmes de M. Kolmogorov concernant les chaines dénombrables. Bull. Soc. Math. France 66, 210–220.Google Scholar
[9] Donsker, M. (1951) An invariance principle for certain probability limit theorems. Mem. Amer. Math. Soc. 6.Google Scholar
[10] Freedman, D. A. (1967) Some invariance principles for functionals of a Markov chain. Ann. Math. Statist. 38, 1–7.Google Scholar
[11] Harrison, J. M. (1973a) Assembly-like queues. J. Appl. Prob. 10, 354–367.Google Scholar
[12] Harrison, J. M. (1973b) The heavy traffic approximation for single server queues in series. J. Appl. Prob. 10, 613–629.Google Scholar
[13] Heyde, C. C. (1969) On extended rate of convergence results for the invariance principle. Ann. Math. Statist. 40, 2178–2179.Google Scholar
[14] Iglehart, D. L. (1965) Limiting diffusion approximations for the many server queue and the repairman problem. J. Appl. Prob. 2, 429–441.Google Scholar
[15] Iglehart, D. L. and Whitt, W. (1970a) Multiple channel queues in heavy traffic, I. Adv. Appl. Prob. 2, 150–177.CrossRefGoogle Scholar
[16] Iglehart, D. L. and Whitt, W. (1970b) Multiple channel queues in heavy traffic, II: sequences, networks, and batches. Adv. Appl. Prob. 2, 355–369.Google Scholar
[17] Iglehart, D. L. (1971) Functional limit theorems for the GI/G/1 queue in light traffic. Adv. Appl. Prob. 3, 269–281.CrossRefGoogle Scholar
[18] Iglehart, D. L. (1972) Extreme values in the GI/G/1 queue. Ann. Math. Statist. 43, 627–635.Google Scholar
[19] Iglehart, D. L. (1973) Weak convergence of compound stochastic processes, I. J. Stochastic Processes and their Applications 1, 11–32.Google Scholar
[20] Îto, K. and McKean, H. P. (1965) Diffusion Processes and their Sample Paths. Springer-Verlag, Berlin.Google Scholar
[21] Kennedy, D. P. (1972a) Rates of convergence for queues in heavy traffic, I. Adv. Appl. Prob. 4, 357–381.Google Scholar
[22] Kennedy, D. P. (1972b) Rates of convergence for queues in heavy traffic, II: sequences of queueing systems. Adv. Appl. Prob. 4, 382–391.Google Scholar
[23] Kennedy, D. P. (1972c) The continuity of the single server queue. J. Appl. Prob. 9, 370–381.Google Scholar
[24] Kiefer, J. and Wolfowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.Google Scholar
[25] Kiefer, J. and Wolfowitz, J. (1956) On the characteristics of the general queueing process with applications to random walks. Ann. Math. Statist. 27, 147–161.CrossRefGoogle Scholar
[26] Kingman, J. F. C. (1961) The single server queue in heavy traffic. Proc. Camb. Phil. Soc. 57, 902–904.CrossRefGoogle Scholar
[27] Kingman, J. F. C. (1962) On queues in heavy traffic. J. R. Statist. Soc. B 24, 383–392.Google Scholar
[28] Kingman, J. F. C. (1965) The heavy traffic approximation in the theory of queues. Proc. Symposium on Congestion Theory. (Eds. Smith, W. and Wilkinson, W.) Univ. of North Carolina Press, Chapel Hill, North Carolina. 137–159.Google Scholar
[29] Lamperti, J. (1964) On extreme order statistics. Ann. Math. Statist. 35, 1726–1737.Google Scholar
[30] Loulou, R. (1973) Multi-channel queues in heavy traffic. J. Appl. Prob. 10, 769–777.CrossRefGoogle Scholar
[31] Loynes, R. M. (1962) The stability of a queue with non-independent interarrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
[32] Prohorov, Yu. V. (1963) Transient phenomena in processes of mass service. Litovsk. Mat. Sb. 3, 199–205. (In Russian.)Google Scholar
[33] Rosenkrantz, W. A. (1967) On rates of convergence for the invariance principle. Trans. Amer. Math. Soc. 129, 542–552.Google Scholar
[34] Schassberger, R. (1970) On the waiting time in the queueing system GI/G/1. Ann. Math. Statist. 41, 182–187.CrossRefGoogle Scholar
[35] Takács, L. (1963) The limiting distribution of the virtual waiting time and the queue size for a single-server queue with recurrent input and general service times. Sankhyā A 25, 91–100.Google Scholar
[36] Whitt, W. (1968) Weak convergence theorems for queues in heavy traffic. , Cornell University. Technical Report No. 2, Department of Operations Research, Stanford University.Google Scholar
[37] Whitt, W. (1970) Multiple channel queues in heavy traffic, III: random server selection. Adv. Appl. Prob. 2, 370–375.Google Scholar
[38] Whitt, W. (1971a) Weak convergence theorems for priority queues: preemptive-resume discipline. J. Appl. Prob. 8, 118–127.Google Scholar
[39] Whitt, W. (1971b) Classical limit theorems for queues. Technical Report, Department of Administrative Sciences, Yale University.Google Scholar
[40] Whitt, W. (1972a) Complements to heavy traffic limit theorems for the GI/G/1 queue. J. Appl. Prob. 9, 185–191.Google Scholar
[41] Whitt, W. (1972b) Embedded renewal processes in the GI/G/s queue. J. Appl. Prob. 9, 650–658.Google Scholar
[42] Whitt, W. (1974) Exponential heavy traffic approximations for GI/G/s queues. Ann. Probability. To appear.Google Scholar