The erlang model with non-poisson call arrivals

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationSIGMETRICS 2006/Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems, Proceedings
Pages276-286
Number of pages11
Edition1
DOIs
Publication statusPublished - 1 Jun 2006
EventSIGMETRICS 2006/Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems - Saint Malo, France
Duration: 26 Jun 200630 Jun 2006

Publication series

NamePerformance Evaluation Review
Number1
Volume34
ISSN (Print)0163-5999
ISSN (Electronic)0163-5999

Conference

ConferenceSIGMETRICS 2006/Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems
Country/TerritoryFrance
CitySaint Malo
Period26/06/0630/06/06

Keywords

  • Erlang formula
  • Insensitivity
  • Loss networks

Fingerprint

Dive into the research topics of 'The erlang model with non-poisson call arrivals'. Together they form a unique fingerprint.

Cite this