On Crossbar Switching Networks
Document Type
Article
Department
Mathematics (HMC)
Publication Date
1975
Abstract
For networks that exhibit neither concentration nor expansion, the well-known probabilistic model of C. Y. Lee is refined so as to take account of the dependence of events in different stages. For series-parallel networks, the refined model yields exact expressions for the point-to-point blocking probability. These expressions bear the same relationship to the refined model as the KittredgeMolina expressions do to Lee's model. Comparison between the two sets of expressions shows that Lee's model tends to overestimate the blocking probability. Asymptotic analysis of the new expressions leads to improved upper bounds on the cost: it is shown that a network that carriesNerlangs with a blocking probability at mostepsilon > 0can be built with6N log_{2} N + O(N log log 1/epsilon)contacts.
Rights Information
© 1975 Institute of Electrical and Electronics Engineers
Terms of Use & License Information
DOI
10.1109/TCOM.1975.1092855
Recommended Citation
Pippenger, N., "On Crossbar Switching Networks," Communications, IEEE Transactions on , vol.23, no.6, pp.646,659, Jun 1975 doi: 10.1109/TCOM.1975.1092855
