The blocking probability of spider-web networks

DOI10.1002/RSA.3240020202zbMath0727.94013OpenAlexW1990983375MaRDI QIDQ3351314

Nicholas J. Pippenger

Publication date: 1991

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240020202

zbMATH Keywords

graphsswitching networkprobabilistic networksspider-web network

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (2)

The asymptotic optimality of spider-web networks ⋮ Unnamed Item

Cites Work

• The asymptotic optimality of spider-web networks
• The Connection Patterns of Two Complete Binary Trees
• On Crossbar Switching Networks
• Optimal Rearrangeable Multistage Connecting Networks

This page was built for publication: The blocking probability of spider-web networks