By Topic

A simple upper bound for blocking probabilities in large multi-rate loss networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Theberge, F. ; Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada ; Simonian, A. ; Mazumdar, R.R.

We consider large loss networks with fixed routing and multi-rate traffic. We use the Laplace method and standard results of multidimensional Gaussian distribution to obtain the upper bounds for the blocking probabilities of new calls under uniform light 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 capacity of the system, so computation are extremely rapid in any case. We verify our method on a small network example. Comparison with simulation results show that we get good upper bounds

Published in:

Electrical and Computer Engineering, 1995. Canadian Conference on  (Volume:1 )

Date of Conference:

5-8 Sep 1995