On a Class of Rearrangeable Switching Networks Part I: Control Algorithm

DOI10.1002/J.1538-7305.1971.TB02569.XMaRDI QIDQ5633915zbMATH OpenOpenAlexFDO

Authors D. C. Opferman, N. T. Tsao-Wu

Publication date 1971

Published in Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/j.1538-7305.1971.tb02570.x

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Recommendations

• A rearrangement algorithm for switching networks composed of digital symmetrical matrices
• Notes on Shuffle/Exchange-Type Switching Networks
• On the Rearrangeability of 2(Iog₂N) –1 Stage Permutation Networks
• scientific article; zbMATH DE number 861327
• Reconfiguration Algorithms for Interconnection Networks

Cited in

(6)

• Testing of three-stage switching networks for coupling faults
• scientific article; zbMATH DE number 3503131 (Why is no real title available?)
• Applications of matching and edge‐coloring algorithms to routing in clos networks
• Shorter arithmetization of nondeterministic computations
• Communication structures in fault‐tolerant distributed systems
• Rearrangeability of bit permutation networks

This page was built for publication: On a Class of Rearrangeable Switching Networks Part I: Control Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633915)