Issue No.02 - February (1991 vol.40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.73594
<p>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.</p>
odd graphs; fault-tolerant interconnection networks; ring; star; mesh; binary n-cube; chordal ring; flip-trees; self-routing algorithms; maximal fault tolerance; resilience; persistence; partitioning property; Hadamard matrices; self-diagnostics; fault tolerant computing; parallel architectures.
A. Ghafoor, T.R. Bashkow, "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks", IEEE Transactions on Computers, vol.40, no. 2, pp. 225-232, February 1991, doi:10.1109/12.73594