Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T20:31:52.721Z Has data issue: false hasContentIssue false

A new view of the heavy-traffic limit theorem for infinite-server queues

Published online by Cambridge University Press:  01 July 2016

Peter W. Glynn*
Affiliation:
Stanford University
Ward Whitt*
Affiliation:
AT & T Bell Laboratories
*
∗ Postal address: Department of Operations Research, Stanford University, Stanford, CA 94305-4022, USA.
∗∗ Postal address: AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974-2070, USA.

Abstract

This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the key assumption. In addition to new proofs of established results, the paper contains several new results, including limits for the work-in-system process, limits for steady-state distributions, limits for open networks with general customer routes, and rates of convergence. The relatively tractable Gaussian limits are promising approximations for many-server queues and open networks of such queues, possibly with finite waiting rooms.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1991 

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

Article purchase

Temporarily unavailable