On a Class of Rearrangeable Switching Networks Part II: Enumeration Studies and Fault Diagnosis

D. C. Opferman, N. Tsao-Wu

Bell System Technical Journal · 1971 · 18 citations · 0 references

Concepts

Abstract

The decomposition of permutations as used in the control algorithm for a class of rearrangeable switching networks is proved. Enumeration studies on permutations related to the network are presented. Theorems for constructing a set of traffic patterns for diagnostic purposes are also given. Finally, a procedure for detecting and locating faulty switching elements in the network is described.