On Rearrangeable and Non-Blocking Switching Networks

Document Type



Mathematics (HMC)

Publication Date



Switching networks of the type used in telephone exchanges are studied, with emphasis on a particular class of networks possessing great structural symmetry. This class contains rearrangeable networks carrying N calls with roughly 6N log3 N contacts, and non-blocking networks with roughly 16N(log5 N)2 contacts; these results are the best obtainable by the methods used. We also show, by an impractical argument, that there are non-blocking networks with roughly 90N log3 N contacts.

Rights Information

© 1978 Elsevier Ltd.

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.