1991/01/01 by Arif Ghafoor, Theodore R. Bashkow · 26 citations
Computer Science · Materials Science · Engineering · Mathematics · #Interconnection Networks and Systems #Supercapacitor Materials and Fabrication #Advancements in Battery Materials #Computer science #Interconnection #Fault tolerance #Routing (electronic design automation) #Routing table #Chordal graph #Table (database) #Theoretical computer science #Distributed computing #Topology (electrical circuits) #Computer network #Mathematics #Combinatorics #Routing protocol
paper · doi:10.1109/12.73594
published in IEEE Transactions on Computers 40(2), 225-232 (Institute of Electrical and Electronics Engineers)
openalex publication_date 1991/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Odd graphs are analyzed to determine their suitable in designing interconnection networks. These networks are shown to possess many features that make them competitive with other architectures, such as ring, star, mesh, the binary n-cube and its generalized form, the chordal ring, and flip-trees. Among the features are small internode distances, a lighter density, simplicity in implementing various self-routing algorithms (both for faulty and nonfaulty networks), capability of maximal fault tolerance, strong resilience, and good persistence. The routing algorithms (both for the faulty and fault-free networks) do not require any table lookup mechanism, and intermediate nodes do not need to modify the message. These graphs are shown to have a partitioning property that is based on Hadamard matrices and can be effectively used for a system's expansion and self-diagnostics.>