The Erlang Model with non-Poisson Call Arrivals

Thomas Bonald (1)

1 Orange Labs [Paris]

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.

Mots clés: Erlang formula; loss networks; insensitivity

Domaines: Réseaux et télécommunications [cs.NI]; Performance et fiabilité [cs.PF]

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⟩