About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On rearrangeable and non-blocking switching networks
Abstract
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. © 1978.