The Erlang model with non-poisson call arrivals
Lists
Only you see this
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.
BibTeX
@inproceedings{bonald2006erlang,
author = {Thomas Bonald},
title = {{The Erlang model with non-poisson call arrivals}},
booktitle = {Sigmetrics/performance},
year = {2006},
doi = {10.1145/1140277.1140309},
}Loading related content...