Technical Reports

The ICICS/CS Reading Room


UBC CS TR-90-18 Summary

The Blocking Probability of Spider-Web Networks, June 1990 Nicholas Pippenger

We determine the limiting behaviour of the blocking probability for spider-web networks, a class of crossbar switching networks proposed by Ikeno. We use a probabilistic model proposed by the author, in which the busy links always form disjoint routes through the network. We show that if the occupancy probability is below the 0.5857 \ldots$, then the blocking probability tends to zero, whereas above this threshold it tends to one. This provides a theoretical explanation for results observed empirically in simulations by Bassalygo, Neiman and Vvedenskaya.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.