By Topic

A new recursive algorithm for calculating end-to-end blocking probability with an arbitrary fixed nonhierarchical routing

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

1 Author(s)
S. Qu ; Inst. of Commun. Syst., Tech. Univ. of Braunschweig, Germany

This paper presents a new recursive algorithm for calculating end-to-end blocking probability (EEB) with an arbitrary fixed nonhierarchical routing (AFNR) in a circuit-switched network. The new algorithm improves the worst bound of the computation amount (WBCA) for the EEB of a node pair given by Chan (1980) 2n-1 times, where n is the number of the loss paths in the path-loss sequence. The amount of its practical computation may be far lower than WBCA, For an extreme case, sequential office-control (SOC) routing, it is proportional to the number of the completion paths from origination node to destination node

Published in:

IEEE Transactions on Communications  (Volume:45 ,  Issue: 12 )