Skip to main content
Article thumbnail
Location of Repository

Steady-state $\mathit{GI}/\mathit{GI}/\mathit{n}$ queue in the Halfin-Whitt regime

By David Gamarnik and David A. Goldberg

Abstract

We consider the FCFS $\mathit{GI}/\mathit{GI}/n$ queue in the so-called Halfin-Whitt heavy traffic regime. We prove that under minor technical conditions the associated sequence of steady-state queue length distributions, normalized by $n^{1/2}$, is tight. We derive an upper bound on the large deviation exponent of the limiting steady-state queue length matching that conjectured by Gamarnik and Momcilovic [Adv. in Appl. Probab. 40 (2008) 548-577]. We also prove a matching lower bound when the arrival process is Poisson. Our main proof technique is the derivation of new and simple bounds for the FCFS $\mathit{GI}/\mathit{GI}/n$ queue. Our bounds are of a structural nature, hold for all $n$ and all times $t\geq0$, and have intuitive closed-form representations as the suprema of certain natural processes which converge weakly to Gaussian processes. We further illustrate the utility of this methodology by deriving the first nontrivial bounds for the weak limit process studied in [Ann. Appl. Probab. 19 (2009) 2211-2269].Comment: Published in at http://dx.doi.org/10.1214/12-AAP905 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Topics: Mathematics - Probability
Year: 2013
DOI identifier: 10.1214/12-AAP905
OAI identifier: oai:arXiv.org:1103.1709
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1103.1709 (external link)
  • http://www.imstat.org/aap/) (external link)
  • http://www.imstat.org) (external link)
  • http://dx.doi.org/10.1214/12-A... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.