UPPER-BOUNDS FOR BLOCKING PROBABILITIES IN LARGE MULTIRATE LOSS NETWORKS

In this paper, we consider large loss networks with fixed routing and multi-rate traffic. We use single-link formulae and standard results o n multidimensional Gaussian distributions to obtain upper bounds for b locking 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 advan tage of our approach is that the complexity does not scale with the si ze of the system, making it numerically attractive. Comparison with si mulation results show that we get good upper bounds. We conclude by di scussing the correlation between links in a network.