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

Author

Qu, Shicai

Author_Institution

Inst. of Commun. Syst., Tech. Univ. of Braunschweig, Germany

Volume

45

Issue

12

fYear

1997

fDate

12/1/1997 12:00:00 AM

Firstpage

1517

Lastpage

1519

Abstract

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) 2^n-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

Keywords

circuit switching; probability; recursive functions; telecommunication network routing; arbitrary fixed nonhierarchical routing; circuit-switched network; completion paths; destination node; end-to-end blocking probability; node pair; origination node; path-loss sequence; recursive algorithm; sequential office-control routing; Algorithm design and analysis; Circuits; Communication switching; Communication systems; Communications Society; Fabrics; Helium; Probability; Routing; Switches;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.650224

Filename

650224