The Blocking Probability of Spider-Web Networks

Document Type

Article

Department

Mathematics (HMC)

Publication Date

1991

Abstract

We determine the limiting behavior 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 threshold 2 - √2 = 0.5857…, 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.

Rights Information

© 1991 Wiley Periodicals, Inc., A Wiley Company

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Link to Full Text

Share

COinS