Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method
Preprint
Abstract
We study the stationary sojourn time distribution in an M/G/1 queue operating under heavy traffic. It is known that the sojourn time converges to an exponential distribution in the limit. Our focus is on obtaining pre-asymptotic, higher-order approximations that go beyond the classical exponential limit. Using Stein's method, we develop an approach based on higher-order expansions of the generator of the underlying Markov process. The key technical step is to represent higher-order derivatives in terms of lower-order ones and control the resulting error via derivative bounds of the Stein equation. Under suitable moment-matching conditions on the service distribution, we show that the approximation error decays as a high-order power of the slack parameter $\varepsilon=1-ρ$. Error bounds are established in the Zolotarev metric, which further imply bounds on the Wasserstein distance as well as the moments. Our results demonstrate that the accuracy of the exponential approximation can be systematically improved by matching progressively more moments of the service distribution.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- A load balancing system in the many-server heavy-traffic asymptoticsQueueing Systems, 2022
- Stein’s method for the single server queue in heavy trafficStatistics & Probability Letters, 2020
- Rates of Convergence in Normal Approximation Under Moment Conditions Via New Bounds on Solutions of the Stein EquationJournal of Theoretical Probability, 2014
- Stein’s method for invariant measures of diffusions via Malliavin calculusStochastic Processes and their Applications, 2012
- Optimal Transport2009
- The Basic M/G/1 Queueing System2005
- Distances de Wasserstein et de ZolotarevComptes Rendus de l'Académie des Sciences - Series I - Mathematics, 2000
- Stein's method for diffusion approximationsProbability Theory and Related Fields, 1990
- The single server queue in heavy trafficMathematical Proceedings of the Cambridge Philosophical Society, 1961
- ber eine Aufgabe der Wahrscheinlichkeitstheorie. IMathematische Zeitschrift, 1930