On critically loaded loss networks

Abstract

This paper studies the behaviour of large loss networks, paying particular attention to links at a certain critical loading where the load offered very nearly matches capacity. We correct and extend an earlier central limit theorem for the stationary distribution of a loss network with critically loaded links. We then use this result to show that acceptance probabilities have a limiting product-form decomposition, despite marked dependencies between the occupancies of critically loaded links.

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 — 52 citations exist upstream.

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