EUVIMEDEUVIMED entdecken
Crossref

Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method

Bihan Chatterjee, Siva Theja Maguluri, Debankur Mukherjee

Proceedings of the ACM on Measurement and Analysis of Computing Systems · 26.03.2026 · 10 (1) · 1-36

DOI: 10.1145/3788095 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Measurement and Analysis of Computing Systems, online erschienen am 26.03.2026. Verfasst von Bihan Chatterjee und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: NSF.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 ? = 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.

Förderung

  • NSF

Zitieren

APA

Chatterjee, B., Maguluri, S. T., & Mukherjee, D. (2026). Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 10(1), 1-36. https://doi.org/10.1145/3788095

Vancouver

Chatterjee B, Maguluri ST, Mukherjee D. Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2026;10(1):1-36. doi:10.1145/3788095

BibTeX
@article{Chatterjee2026,
  author = {Chatterjee, Bihan and Maguluri, Siva Theja and Mukherjee, Debankur},
  title = {Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method},
  journal = {Proceedings of the ACM on Measurement and Analysis of Computing Systems},
  year = {2026},
  volume = {10},
  number = {1},
  pages = {1--36},
  doi = {10.1145/3788095}
}
Kostenlos starten →