Blocking probabilities for large multirate erlang loss systems

Abstract

This paper is concerned with the computation of asymptotic blocking probabilities for a generalized Erlangian system which results whenMindependent Poisson streams of traffic with rates access a trunk group ofCcircuits with traffic from streamkrequiringAkcircuits which are simultaneously held and released after a time which is randomly distributed with unit mean and independent of earlier arrivals and holding times. A call from streamkis lost if on arrival less thanAkcircuits are available. Although exact expressions for the blocking probabilities are known, their computation is unwieldy for even moderate-sized switches. It is shown that as the size of the switch increases in that both the traffic rates and trunk capacity are scaled together, simple asymptotic expressions for the blocking probabilities are obtained. In particular the expression is different for light, moderate and heavy loads. The approach is via exponential centering and large deviations and provides a unified framework for the analysis.

Cite this work

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

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

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