By Topic

An Approximate Method for Computing Blocking Probability in Switching 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
$33 $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

2 Author(s)
L. Lee ; Univ. of Ottawa, Ottawa, Canada ; J. Brzozowski

This paper describes an approximate method for evaluating the blocking probability of a switching network. The model used is C. Y. Lee's probability linear graph. By changing the structure of the graph between a pair of adjacent stages in two ways, it is possible to obtain upper and lower bounds for the blocking probability. The calculation of the bounds is performed on graphs which have a simpler structure as a result of the changes made. A suitable form is then chosen for the approximate blocking probability within the bounds. Typical multistage networks are treated in this fashion, and the approximate results are compared with the accurate blocking probabilities. The method is simple and inexpensive and produces reasonably accurate results.

Published in:

IEEE Transactions on Communication Technology  (Volume:14 ,  Issue: 2 )