Loss networks and Markov random fields
- 1 June 1999
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 36 (02) , 403-414
- https://doi.org/10.1017/s0021900200017216
Abstract
This paper examines the connection between loss networks without controls and Markov random field theory. The approach taken yields insight into the structure and computation of network equilibrium distributions, and into the nature of spatial dependence in networks. In addition, it provides further insight into some commonly used approximations, enables the development of more refined approximations, and permits the derivation of some asymptotically exact results.Keywords
This publication has 17 references indexed in Scilit:
- An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss modelsAdvances in Applied Probability, 1995
- Loss NetworksThe Annals of Applied Probability, 1991
- On blocking in loss networksAdvances in Applied Probability, 1991
- On critically loaded loss networksAdvances in Applied Probability, 1989
- Limit theorems for loss networks with diverse routingAdvances in Applied Probability, 1989
- Congestion probabilities in a circuit-switched integrated services networkPerformance Evaluation, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional latticeStochastic Processes and their Applications, 1985
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Countable State Space Markov Random Fields and Markov Chains on TreesThe Annals of Probability, 1983