Loss networks and Markov random fields

Journal of Applied Probability

Volumn 36, Issue 2, 1999, Pages 403-414

  Zachary, Stan ^a   Ziedins, Ilze ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Erlang fixed point; Loss networks; Markov random fields; Reduced load approximations

Indexed keywords

EID: 0033235828     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200017216     Document Type: Article

References (20)

1. BEAN, N. G. AND STEWART, M. A. (1999). A new perspective on the normalisation of invariant measures for loss networks and other product form systems. To appear in Math. Comput. Modelling.
2. BEBBINGTON, M. S., POLLETT, P. K. AND ZIEDINS, I. (1997). Improved fixed point methods for loss networks with linear structure. Proc. 4th Internat. Conf. Telecommun., Melbourne, Australia 3, 1411-1416.
3. BURMAN, D. Y., LEHOCZKY, J. P. AND LIM, Y. (1984). Insensitivity of blocking probabilities in a circuit-switched network. J. Appl. Prob. 21, 850-859.
4. BUZEN, J. P. (1973). Computational algorithms for closed queueing networks with exponential servers. Commun. ACM 16, 527-531.
5. CHOUDHURY, K. K., LEUNG, G. L. AND WHITT, W. (1995). An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models. Adv. Appl. Prob. 27, 1104-1143.
6. CHUNG, S. P. AND ROSS, K. W. (1991). Reduced load approximations for multirate loss networks. IEEE Trans. Commun. 41, 726-736.
7. DZIONG, Z. AND ROBERTS, J. W. (1987). Congestion probabilities in a circuit-switched integrated services network. Perf. Eval. 7, 267-284.
8. HUNT, P. J. AND KELLY, F. P. (1989). On critically loaded loss networks. Adv. Appl. Prob. 21, 831-841.
9. HUNT, P. J. AND LAWS, C. N. (1991). Asymptotically optimal loss network control. Math. Operat. Res. 18, 880-900.
10. KELLY, F. P. (1985). Stochastic models of computer communication systems. J. R. Statist. Soc. B 47, 379-395.
11. KELLY, F. P. (1986). Blocking probabilities in large circuit-switched networks. Adv. Appl. Prob. 18, 473-505.
12. KELLY, F. P. (1991). Loss networks. Ann. Appl. Prob. 1, 319-378.
13. MACPHEE, I. M. AND ZIEDINS, I. (1996). Admission controls for loss networks with diverse routing. In Stochastic Networks: Theory and Applications, eds F. P. Kelly, S. Zachary and I. Ziedins. OUP, Oxford, pp. 205-214.
14. Ross, K. W. (1995). Multiservice loss models for broadband telecommunication networks. Springer, New York.
15. SENETA, E. (1981). Non-negative matrices and Markov chains, 2nd edn. Springer.
16. WHITT, W. (1985). Blocking when service is required from several facilities simultaneously. AT&T Technical Journal 64, 1807-1856.
17. ZACHARY, S. (1983). Countable state space Markov random fields and Markov chains on trees. Ann. Prob. 11, 894-903.
18. ZACHARY, S. (1985). Bounded, attractive and repulsive Markov specifications on trees and on the one-dimensional lattice. Stoch. Proc. Appl. 20, 247-256.
19. ZACHARY, S. (1991). On blocking in loss networks. Adv. Appl. Prob. 23, 355-372.
20. ZIEDINS, I. B. AND KELLY, F. P. (1989). Limit theorems for loss networks with diverse routing. Adv. Appl. Prob. 21, 804-830.