Blocking States in Connecting Networks Made of Square Switches Arranged in Stages
Vladimír Beneš · Bell System Technical Journal · 1981
Since the probability of blocking is a principal measure of the performance of a network, this paper examines the blocking states of a network. For two-sided connecting networks made of square switches arranged in stages, a parallel pair (PP) is a pair of paths through the network that meet at no switch. The blocking states of the network are closely related to those that have a busy PP. In particular, a routing algorithm can avoid all the blocking states if and only if it avoids all the states with busy PPS.