pith. sign in

arxiv: 1602.02866 · v1 · pith:UTPPH26Dnew · submitted 2016-02-09 · 🧮 math.PR

High order steady-state diffusion approximation of the Erlang-C system

classification 🧮 math.PR
keywords diffusionapproximationsteady-statedistributionsystemapproximationscoefficientcount
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A new $1/(1-\rho)$-scaling bound for multiserver queues via a leave-one-out technique

    math.PR 2025-10 unverdicted novelty 7.0

    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 heterogeneou...