Moderate deviations of many-server queues in the Halfin-Whitt regime and weak convergence methods
Anatolii Puhalskii
TL;DR
The paper develops logarithmic (moderate) deviation asymptotics for the number-in-system process $Q_n(t)$ in many-server queues under the Halfin–Whitt regime with general interarrival and service times. It proves a Large Deviation Principle with rate $b_n^2$ for the scaled process $X_n(t)=\frac{\sqrt{n}}{b_n}(\frac{Q_n(t)}{n}-1)$, and expresses the deviation function via a Fredholm equation of the second kind, using an idempotent-process weak-convergence framework and exponential tightness. The trajectory-level results include a variational rate function $I^Q(q)$ and a limit idempotent process $X$ driven by Brownian-bridge and Kiefer idempotent components, with explicit integral equations; special cases with renewal arrivals yield a Wiener-idempotent limit. The work provides a practical route to compute moderate-deviation exponents and demonstrates the utility of weak-convergence methods for LDP proofs in complex queueing systems. The findings advance understanding of probability tails for performance metrics in many-server queues, with potential applications to staffing and reliability analyses.
Abstract
This paper obtains logarithmic asymptotics of moderate deviations of the stochastic process of the number of customers in a many--server queue with generally distributed interarrival and service times in the Halfin--Whitt heavy traffic regime. The deviation function is expressed in terms of the solution to a Fredholm equation of the second kind. The proof uses characterisation of large deviation relatively compact sequences of probability measures as exponentially tight ones.
