Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Fault-tolerant computing: theory and techniques; vol. 1
Fault-tolerant computing: theory and techniques; vol. 1
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Graph Theory With Applications
Graph Theory With Applications
A Study of Odd Graphs as Fault-Tolerant Interconnection Networks
IEEE Transactions on Computers
An Observation on the Bisectional Interconnection Networks
IEEE Transactions on Computers
Operationally Enhanced Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Flexible oblivious router architecture
IBM Journal of Research and Development
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Combinatorial Properties of Two-Level Hypernet Networks
IEEE Transactions on Parallel and Distributed Systems
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs
IEEE Transactions on Computers
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Hyper-deBruijn Networks: Scalable Versatile Architecture
IEEE Transactions on Parallel and Distributed Systems
VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures.
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
| Hi-index | 0.01 |
A family of graphs is introduced with (d(d-1)/sup l/-2)/(d-2) nodes, where d is the degree of every node and l is any positive integer. The graphs have diameter 2l-1. In the presence of at most d-1 faults, the diameter increases to at most 2l+1. Furthermore, there exists a container (set of node-disjoint paths) of width d and length at most 2l+1 between every pair of nodes. The graphs are compared to those that have been proposed previously with respect to diameter, fault-tolerant diameter, container width, ease of routing, ease of fault-tolerant routing, and extensibility.