Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
On the connectivity of the De Bruijn graph
Information Processing Letters
Uniform minimal full-access networks
Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Bidirectional versus Unidirectional Networks: Cost/Performance Trade-Offs
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Low Diameter Interconnections for Routing in High-Performance Parallel Systems
IEEE Transactions on Computers
RISC: A resilient interconnection network for scalable cluster storage systems
Journal of Systems Architecture: the EUROMICRO Journal
A distributed algorithm of fault recovery for stateful failover
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph
Information Processing Letters
| Hi-index | 15.00 |
The authors introduce a novel class of networks based on the de Bruijn graph. These directed graphs are regular of degree, have N=k/sup n/ vertices for some n, and can tolerate up to k-2 node faults. Their fault-free diameter is n=log/sub k/N, and this is increases by at most 1 hop in the presence of k-2 faults. This class is very rich: for any given N=k/sup n/, one can construct at least 2/sup N/ different graphs. This is in sharp contrast to most other such constructions (including the de Bruijn graph), in which only one graph exists for each N. It is also shown how to implement certain algorithms on these networks.