Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's Method
Open Access
- 8 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 55-57
Abstract
No abstract availableFunding Information
- NSF (National Science Foundation) (EPCN-2144316)
- NSF (National Science Foundation) (CMMI-2140534)
- NSF (National Science Foundation) (2127778)
- NSF (National Science Foundation) (2348409)
This publication has 11 references indexed in Scilit:
- Higher-Order Approximations of Sojourn Times in M/G/1 Queues via Stein's MethodProceedings of the ACM on Measurement and Analysis of Computing Systems, 2026
- High-Order Steady-State Diffusion ApproximationsOperations Research, 2022
- Stein’s method for the single server queue in heavy trafficStatistics & Probability Letters, 2020
- Weighted Zolotarev metrics and the Kantorovich metricDoklady Mathematics, 2017
- Stein’s Method for Steady-state Diffusion Approximations: An Introduction through the Erlang-A and Erlang-C ModelsStochastic Systems, 2016
- Optimal Transport2009
- The Basic M/G/1 Queueing System2005
- A Bound for the Error in the Normal Approximation to the Distribution of a Sum of Dependent Random Variables1972
- A Single-Server Queue with Poisson InputOperations Research, 1962
- ber eine Aufgabe der Wahrscheinlichkeitstheorie. IMathematische Zeitschrift, 1930