Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

On Queues in Heavy Traffic

J. F. C. Kingman
Journal of the Royal Statistical Society. Series B (Methodological)
Vol. 24, No. 2 (1962), pp. 383-392
Published by: Wiley for the Royal Statistical Society
Stable URL: http://www.jstor.org/stable/2984229
Page Count: 10
  • Read Online (Free)
  • Download ($29.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On Queues in Heavy Traffic
Preview not available

Abstract

We say that a single server queue is in "heavy traffic" when the traffic intensity ρ is less than, but very near, unity. Then the equilibrium waiting time w will be large, and it is proved that, under certain conditions, the distribution of (1 - ρ)w tends, as ρ tends to 1, to a negative exponential distribution. The conditions under which this result holds are fairly weak, and, in particular, it is not necessary to make the assumption of independent inter-arrival times.

Page Thumbnails

  • Thumbnail: Page 
383
    383
  • Thumbnail: Page 
384
    384
  • Thumbnail: Page 
385
    385
  • Thumbnail: Page 
386
    386
  • Thumbnail: Page 
387
    387
  • Thumbnail: Page 
388
    388
  • Thumbnail: Page 
389
    389
  • Thumbnail: Page 
390
    390
  • Thumbnail: Page 
391
    391
  • Thumbnail: Page 
392
    392