The Erlang Model with non-Poisson Call Arrivals

Abstract : The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it is in fact sufficient that users generate sessions according to a Poisson process, each session being composed of a random, finite number of calls and idle periods. A key role is played by the retrial behavior in case of call blocking. We illustrate the results by a number of examples.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01274120
Contributor : Thomas Bonald <>
Submitted on : Wednesday, February 17, 2016 - 4:14:07 PM
Last modification on : Friday, February 19, 2016 - 8:56:30 AM
Long-term archiving on : Wednesday, May 18, 2016 - 1:10:01 PM

File

erlang.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01274120, version 1

Citation

Thomas Bonald. The Erlang Model with non-Poisson Call Arrivals. Sigmetrics / Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems, Jun 2006, Saint Malo, France. ⟨hal-01274120⟩

Share

Metrics

Record views

79

Files downloads

648