Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-10T14:42:10.385Z Has data issue: false hasContentIssue false
  • English
  • Français

A new heavy-traffic limit theorem for many-server queues

Published online by Cambridge University Press:  01 July 2016

Shlomo Halfin  and
Ward Whitt
Shlomo Halfin
Affiliation:
(Bell Laboratories)
Ward Whitt
Affiliation:
(Bell Laboratories)
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Ninth Conference on Stochastic Processes and their Applications, Evanston, Illinois, 6–10 August 1979
Information
Advances in Applied Probability , Volume 12 , Issue 2 , June 1980 , pp. 295
Copyright
Copyright © Applied Probability Trust 1980 

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. Borovkov, A. A. (1967) On limit laws for service processes in multi-channel systems. Siberian Math. J. 8, 746–763.CrossRefGoogle Scholar
2. Iglehart, D. L. (1965) Limit diffusion approximations for the many server queue and repairman problem. J. Appl. Prob. 2, 429–441.CrossRefGoogle Scholar
3. Iglehart, D. L. and Whitt, W. (1970) Multiple channel queues in heavy traffic, II: sequences, networks and batches. Adv. Appl. Prob. 2, 355–369.CrossRefGoogle Scholar
4. Kingman, J. F. C. (1961) The single server queue in heavy traffic. Proc. Camb. Phil. Soc. 57, 902–904.CrossRefGoogle Scholar