On Blocking Probabilities for Switching Networks
Fan Chung, F. K. Hwang · Bell System Technical Journal · 1977
We study the blocking probabilities of multistage switching networks through their linear graphs using Lee's model. We give results which allow us to compare the blocking probabilities of various classes of linear graphs. In particular, we derive techniques for deciding when the blocking probability of one linear graph does not exceed the blocking probability of another linear graph under all possible traffic loads. This allows us to compare the blocking performances of corresponding switching networks containing these linear graphs. Our results apply not only to series-parallel linear graphs, but also to the more general “spider-web” linear graphs, which have recently attracted substantial interest in the theory of switching networks.