article · Scholarship - Claremont (Claremont Colleges) · 1991

The Blocking Probability of Spider-Web Networks

Pippenger, Nicholas

Cited by 0Abstract and details only

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.

Cite this paper

APA 7

Pippenger, N. (1991). The Blocking Probability of Spider-Web Networks. Scholarship - Claremont (Claremont Colleges). https://doi.org/10.1002/rsa.3240020202/abstract

MLA 9

Pippenger, Nicholas. “The Blocking Probability of Spider-Web Networks.” Scholarship - Claremont (Claremont Colleges), 1991, https://doi.org/10.1002/rsa.3240020202/abstract.

Chicago

Pippenger, Nicholas. 1991. “The Blocking Probability of Spider-Web Networks.” Scholarship - Claremont (Claremont Colleges). https://doi.org/10.1002/rsa.3240020202/abstract.

Harvard

Pippenger, N. (1991) ‘The Blocking Probability of Spider-Web Networks’, Scholarship - Claremont (Claremont Colleges). Available at: https://doi.org/10.1002/rsa.3240020202/abstract.

BibTeX

@article{pippenger1991blocking,
  title = {{The Blocking Probability of Spider-Web Networks}},
  author = {Pippenger, Nicholas},
  journal = {Scholarship - Claremont (Claremont Colleges)},
  year = {1991},
  doi = {10.1002/rsa.3240020202/abstract}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.