On critically loaded loss networks
- 1 March 1989
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 21 (04) , 831-841
- https://doi.org/10.1017/s0001867800019078
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.Keywords
This publication has 6 references indexed in Scilit:
- Implied costs in loss networksAdvances in Applied Probability, 1989
- Routing in circuit-switched networks: optimization, shadow prices and decentralizationAdvances in Applied Probability, 1988
- Congestion probabilities in a circuit-switched integrated services networkPerformance Evaluation, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Some Properties of the Erlang Loss FunctionBell System Technical Journal, 1974