Path Rearranging in a Data Switching Network
C.M. Melas · IRE Transactions on Communications Systems · 1983
Path rearranging results in a 60 percent savings of hardware in a nonblocking 2048-line switch. The blocked connection is freed up by exchanging paths between two middle matrices. Selection criteria for the middle matrices include the incidence of duplicate connections through these matrices. A path rearranging algorithm is derived from the Paull method and implemented in software by the network control microprocessor. Two buses are required for data switching to prevent any interruption in the data stream during rearranging.