Simple and Explicit Bounds for Multiserver Queues with 1 1 − ρ Scaling

We consider the first-come-first-serve (FCFS) G I / G I / n queue and prove the first simple and explicit bounds that scale as 1 1 − ρ under only the assumption that interarrival times have finite second moment, and service times have finite 2 + ϵ moment for some ϵ > 0 . Here, ρ denotes the corresponding traffic intensity. Conceptually, our results can be viewed as a multiserver analogue of Kingman’s bound. Our main results are bounds for the tail of the steady-state queue length and the steady-state probability of delay. The strength of our bounds (e.g., in the form of tail decay rate) is a function of how many moments of the service distribution are assumed finite. Our bounds scale gracefully, even when the number of servers grows large and the traffic intensity converges to unity simultaneously, as in the Halfin-Whitt scaling regime. Some of our bounds scale better than 1 1 − ρ in certain asymptotic regimes. In these same asymptotic regimes, we also prove bounds for the tail of the steady-state number in service. Our main proofs proceed by explicitly analyzing the bounding process that arises in the stochastic comparison bounds of Gamarnik and Goldberg for multiserver queues. Along the way, we derive several novel results for suprema of random walks and pooled renewal processes, which may be of independent interest. We also prove several additional bounds using drift arguments (which have much smaller prefactors) and point out a conjecture that would imply further related bounds and generalizations. We also show that when all moments of the service distribution are finite and satisfy a mild growth rate assumption, our bounds can be strengthened to yield explicit tail estimates decaying as O ( exp ( − x α ) ) , with α ∈ ( 0 , 1 ) , depending on the growth rate of these moments.