A new O(1/(1-ρ)) upper bound on expected queue length for light-tailed G/G/n queues is established via leave-one-out coupling and quadratic test functions, with improved leading constants and extension to heterogeneous servers.
High order steady-state diffusion approximation of the Erlang-C system
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we introduce a new diffusion approximation for the steady-state customer count of the Erlang-C system. Unlike previous diffusion approximations, which use the steady-state distribution of a diffusion process with a constant diffusion coefficient, our approximation uses the steady-state distribution of a diffusion process with a \textit{state-dependent} diffusion coefficient. We show, both analytically and numerically, that our new approximation is an order of magnitude better than its counterpart. To obtain the analytical results, we use Stein's to show that a variant of the Wasserstein distance between the normalized customer count distribution and our approximation vanishes at a rate of $1/R$, where $R$ is the offered load to the system. In contrast, the previous approximation only achieved a rate of $1/R$. We hope our results motivate others to consider diffusion approximations with state-dependent diffusion coefficients.
fields
math.PR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A new $1/(1-\rho)$-scaling bound for multiserver queues via a leave-one-out technique
A new O(1/(1-ρ)) upper bound on expected queue length for light-tailed G/G/n queues is established via leave-one-out coupling and quadratic test functions, with improved leading constants and extension to heterogeneous servers.