Work2006

The Erlang model with non-poisson call arrivals

16 citations0/0 files storedACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Wireless Communication Networks Research Probability and Risk Models

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 16 citations exist upstream.

References

1989Stochastic Modeling and the Theory of Queues 1981Blocking in a Shared Resource Environment 1997Retrial Queues 1991Loss Networks 1986Blocking probabilities in large circuit-switched networks 1999Introduction to Stochastic Networks 1984Insensitivity of blocking probabilities in a circuit-switching network 1965Analysis of Mixtures of Wide- and Narrow-Band Traffic

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.