Limit theorems for loss networks with diverse routing
- 1 December 1989
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 21 (4) , 804-830
- https://doi.org/10.2307/1427768
Abstract
Loss networks have long been of interest to telephone engineers, and are becoming increasingly important as models of computer and information systems. In this paper we present an asymptotic analysis of loss networks exhibiting various forms of symmetry. Our aim is to better understand the behaviour of networks involving very large numbers of links and routes, where an exact analysis is not possible and approximations are required.Keywords
This publication has 14 references indexed in Scilit:
- Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive LocksSIAM Journal on Computing, 1985
- Blocking When Service Is Required From Several Facilities SimultaneouslyAT&T Technical Journal, 1985
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Probabilistic Models of Database LockingJournal of the ACM, 1984
- The Overload Performance of Engineered Networks With Nonhierarchical and Hierarchical RoutingAT&T Bell Laboratories Technical Journal, 1984
- Some Poisson Approximations Using CompensatorsThe Annals of Probability, 1983
- Some distributional approximations in Markovian queueing networksAdvances in Applied Probability, 1982
- Some distributional approximations in Markovian queueing networksAdvances in Applied Probability, 1982
- Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-ForwardIEEE Transactions on Communications, 1978
- Analysis of Dependence Effects in Telephone Trunking NetworksBell System Technical Journal, 1971