Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-06-15T16:38:13.586Z Has data issue: false hasContentIssue false
  • English
  • Français

Heavy traffic theory for queues with several servers. I

Published online by Cambridge University Press:  14 July 2016

Julian Köllerström
Julian Köllerström*
Affiliation:
University of Oxford
*
*Now at the University of Kent.
Get access Rights & Permissions [Opens in a new window]

Abstract

Queues with several servers are examined here, in which arrivals are assumed to form a renewal sequence and successive service times to be mutually independent and independent of the arrival times. The first-come-first-served queue discipline only is considered. An asymptotic formula for the equilibrium waiting time distribution is obtained under conditions of heavy traffic.

Keywords

QUEUES IN STATISTICAL EQUILIBRIUMSEVERAL SERVERSINDEPENDENCEWAITING TIMEHEAVY TRAFFICASYMPTOTIC EXPONENTIAL DISTRIBUTION
Type
Research Papers
Information
Journal of Applied Probability , Volume 11 , Issue 3 , September 1974 , pp. 544 - 552
Copyright
Copyright © Applied Probability Trust 1974 

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.)

Footnotes

Research supported by the Science Research Council.

References

Blomqvist, N. (1974) A simple derivation of the GI/G/1 waiting time distribution in heavy traffic. Scand. J. Statist. 1, 39–40.Google Scholar
Cohen, J. W. (1969) The Single Server Queue. North-Holland, Amsterdam.Google Scholar
Kiefer, J. and Wolfowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.Google Scholar
Kiefer, J. and Wolfowitz, J. (1956) On the characteristics of the general queueing process, with applications to random walk. Ann. Math. Statist. 27, 147–161.Google Scholar
Kingman, J. F. C. (1961a) The single server queue in heavy traffic. Proc. Camb. Phil. Soc. 57, 902–904.Google Scholar
Kingman, J. F. C. (1961b) The ergodic behaviour of random walks. Biometrika 48, 391–396.Google Scholar
Kingman, J. F. C. (1962a) On queues in heavy traffic. J. R. Statist. Soc. B 24, 383–392.Google Scholar
Kingman, J. F. C. (1962b) Some inequalities for the queue GI/G/1. Biometrika 49, 315–324.Google Scholar
Kingman, J. F. C. (1965) The heavy traffic approximation in the theory of queues. Proc. Symp. on Congestion Theory. Eds. Smith, W. L. and Wilkinson, W. E. University of North Carolina Press, Chapel Hill, N.C. Google Scholar
Lindley, D. V. (1952) Theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–289.Google Scholar
Loynes, R. M. (1962) The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
Lukacs, E. (1960) Characteristic Functions. Griffin's Statistical Monographs and Courses, no. 5. Griffin, London.Google Scholar
Pollaczek, F. (1961) Théorie analytique des problèmes stochastiques relatifs à un groupe de lignes téléphoniques avec dispositif d'attente. Mémor. Sci. Math. 150.Google Scholar
Whitt, W. (1973) Exponential heavy traffic approximations for GI/G/s queues. (Private communication.) Google Scholar