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.
Type de document :
Communication dans un congrès
Sigmetrics / Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems, Jun 2006, Saint Malo, France. Proceedings of ACM Sigmetrics / Performance, 2006
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01274120
Contributeur : Thomas Bonald <>
Soumis le : mercredi 17 février 2016 - 16:14:07
Dernière modification le : vendredi 19 février 2016 - 08:56:30
Document(s) archivé(s) le : mercredi 18 mai 2016 - 13:10:01

Fichier

erlang.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. Proceedings of ACM Sigmetrics / Performance, 2006. <hal-01274120>

Partager

Métriques

Consultations de
la notice

38

Téléchargements du document

63