Heavy-traffic limits for the G/H∗ 2 /n/m queue (2005)
| Venue: | Math. Oper. Res |
| Citations: | 23 - 12 self |
BibTeX
@ARTICLE{Whitt05heavy-trafficlimits,
author = {Ward Whitt},
title = {Heavy-traffic limits for the G/H∗ 2 /n/m queue},
journal = {Math. Oper. Res},
year = {2005},
volume = {30},
pages = {1--27}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We establish heavy-traffic stochastic-process limits for queue-length, waiting-time and over-flow stochastic processes in a class of G/GI/n/m queueing models with n servers and m extra waiting spaces. We let the arrival process be general, only requiring that it satisfy a functional central limit theorem. In order to capture the impact of the service-time distribution beyond its mean within a Markovian framework, we consider a special class of service-time distribu-tions, denoted by H ∗ 2, which are mixtures of an exponential distribution with probability p and a unit point mass at 0 with probability 1 − p. These service-time distributions exhibit relatively high variability, having squared coefficients of variation greater than or equal to one. As in Halfin and Whitt (1981), Puhalskii and Reiman (2000) and Garnett, Mandelbaum and Reiman (2000), we consider a sequence of queueing models indexed by the number of servers, n, and let n tend to infinity along with the traffic intensities ρn so that √ n(1 − ρn) → β for − ∞ < β < ∞. To treat finite waiting rooms, we let mn / √ n → κ for 0 < κ ≤ ∞. With the special H ∗ 2 service-time distribution, the limit processes are one-dimensional Markov processes, behaving like diffusion processes with different drift and diffusion functions in two different re-gions, above and below zero. We also establish a limit for the G/M/n/m + M model, having exponential customer abandonments.
