Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-12-01T00:14:25.980Z Has data issue: false hasContentIssue false

On blocking in loss networks

Published online by Cambridge University Press:  01 July 2016

S. Zachary*
Affiliation:
Heriot-Watt University
*
Postal address: Department of Actuarial Mathematics and Statistics, Heriot-Watt University, Riccarton, Edinburgh, EH14 4AS, UK.

Abstract

We consider a ‘reduced state space' approach to the analysis of blocking in stochastic loss networks. We show how this approach provides insight into the approximations currently used in large networks and enables improved approximations to be deduced. We further give some ‘heavy traffic' asymptotic results for the limiting scheme of Kelly (1986).

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1991 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Burman, D. Y., Lehoczky, J. P. and Lim, Y. (1984) Insensitivity of blocking probabilities in a circuit-switched network. J. Appl. Prob. 21, 850859.Google Scholar
Dziong, Z. and Roberts, J. W. (1987) Congestion probabilities in a circuit-switched integrated services network. Performance Eval. 7, 267284.Google Scholar
Hunt, P. J. and Kelly, F. P. (1989) On critically loaded loss networks. Adv. Appl. Prob. 21, 831841.CrossRefGoogle Scholar
Kelly, F. P. (1986) Blocking probabilities in large circuit-switched networks. Adv. Appl. Prob. 18, 473505.Google Scholar
Mardia, K. V., Kent, J. T. and Bibby, J. M. (1979) Multivariate Analysis. Academic Press, London.Google Scholar
Whittle, P. (1988) Approximation in large-scale circuit-switched networks. Prob. Eng. Inf. Sci. 2, 279291.Google Scholar