By Topic

Analytic Approximation of Blocking Probabilities in Circuit Switched Communication 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

1 Author(s)
Deschamps, P. ; Dept of Economics, Univ of Birmingham, England

A method inspired from S. Katz's service evaluation algorithm [6] is presented. The new algorithm is recursive, rather than iterative, in nature, and especially suited for networks that do not contain cycles. It also introduces two new features which take existing theoretical results into account, and as such corresponds more closely to the current state of traffic theory.

Published in:

Communications, IEEE Transactions on  (Volume:27 ,  Issue: 3 )