Back to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek

A. J. E. M. Janssen and J. S. H. Van Leeuwaarden

Statistica Neerlandica, 2008, vol. 62, issue 3, 299-313

Abstract: A.K. Erlang introduced the M/D/s queue in 1917, while F. Pollaczek and C.D. Crommelin formalized the theory using complex analysis and transforms. Let D(s,λ) denote the stationary probability of experiencing no waiting time in the M/D/s queue with arrival rate λ and service requirement 1. We use D(s,λ) as a vehicle to give an overview of some of the results we obtained over the last years, including explicit characterizations of the roots, the derivation of infinite series from expressions in terms of roots using Fourier sampling and heavy‐traffic limits obtained from square‐root staffing. We propose to call D(s,λ) the Erlang D formula, for which several new results are presented and compared with the results of Pollaczek.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.2008.00395.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:62:y:2008:i:3:p:299-313

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().