Abstract
In this paper, we consider large loss networks with fixed routing and multi‐rate traffic. We use single‐link formulae and standard results on multidimensional Gaussian distributions to obtain upper bounds for blocking probabilities of new calls under light up to critical loading conditions. This is the loading regime of interest for many practical applications such as admission control in ATM networks. The main advantage of our approach is that the complexity does not scale with the size of the system, making it numerically attractive. Comparison with simulation results show that we get good upper bounds. We conclude by discussing the correlation between links in a network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Bleistein, Uniform asymptotic expansions of integrals with stationary point near algebraic singularity, Comm. Pure Appl. Math. 19 (1966) 353-370.
K. Choudhury, K.K. Leung and W. Whitt, An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models, Adv. Appl. Probab. 27 (1995) 1104-1143.
S.P. Chung and K.W. Ross, Reduced load approximations for multirate loss networks, IEEE Trans. Commun. 41(8) (August 1993) 1222-1231.
Z. Dziong and J.W. Roberts, Congestion probabilities in a circuit-switched integrated services network, Performance Evaluation 7 (1987) 267-284.
P. Gazdzicki, I. Lambadaris and R.R. Mazumdar, Blocking probabilities for large multi-rate Erlang loss systems, Adv. Appl. Probab. 25 (1993) 997-1009.
J.Y. Hui, Resource allocation for broadband networks, IEEE J. Select. Areas Commun. 6 (1988) 1598-1608.
P.J. Hunt and F.P. Kelly, On critically loaded loss networks, Adv. Appl. Probab. 21 (1989) 831-841.
J.S. Kaufman, Blocking in a shared resources environment, IEEE Trans. Commun. 29(10) (1981) 1474-1481.
F.P. Kelly, Loss networks, Ann. Appl. Probab. 1(3) (1991) 319-378.
F.P. Kelly, Effective bandwidths at multi-class queues, Queueing Systems 9 (1991) 5-16.
D. Mitra and J.A. Morrison, Erlang capacity and uniform approximations for shared unbuffered resources, IEEE/ACM Trans. Networking 2(6) (1994) 558-570.
V.V. Sazonov, Normal Approximation — Some Recent Advances, Lecture Notes in Mathematics 879 (Springer, Berlin, 1981).
A. Simonian, Analyse asymptotique des taux de blocage pour un trafic multidébit, Ann. Télécom. 47(1-2) (1992) 56-63.
F. Théberge, Approximation des probabilités de blocage dans un réseau multidébit en charge critique ou faible par la méthode de Laplace, CNET (France Telecom) PAA/ATR/GTR, Issy Les Moulineaux, France (January 1995).
F. Théberge and R.R. Mazumdar, Approximations for blocking probabilities in a multi-rate loss system: A probabilistic approach, in: Proc. of INFOCOM '95, Boston (1995).
F. Théberge, Analyse du blocage dans un système multi-débit avec pertes et réservation, M.Sc. thesis, INRS-Télécommunications, Montreal (1993).
Y.L. Tong, The Multivariate Normal Distribution, Springer Series in Statistics (Springer, Berlin, 1990).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Theberge, F., Simonian, A. & Mazumdar, R.R. Upper bounds for blocking probabilities in large multi‐rate loss networks. Telecommunication Systems 9, 23–39 (1998). https://doi.org/10.1023/A:1019182009119
Issue Date:
DOI: https://doi.org/10.1023/A:1019182009119