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

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