Refinements to Heavy Traffic Limit Theorems in Queueing Theory

Charles Knessl
Additional contact information
Charles Knessl: University of Illinois at Chicago, Chicago, Illinois

Operations Research, 1990, vol. 38, issue 5, 826-837

Abstract: We consider single server M/G/1 and GI/G/1 queues in the limit of heavy traffic. We develop a procedure for obtaining the full asymptotic series of the stationary distribution of unfinished work in powers of one minus the traffic intensity. The leading term in this series is the (exponential) density obtained from the heavy traffic limit theorem. We show that the correction terms have different forms in different regions of the state space. These corrections are constructed using the method of matched asymptotic expansions. We assume that the method of matched asymptotic expansions is valid.

Keywords: queues; diffusion models: refining diffusion approximations (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.5.826 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:5:p:826-837

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().