On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
A New Class of Fault-Tolerant Static Interconnection Networks
IEEE Transactions on Computers
A robust protocol for parallel join operation in distributed data bases
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Fault-Tolerant Networks Based on the de Bruijn Graph
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Routing and Transmitting Problems in de Bruijn Networks
IEEE Transactions on Computers
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
An efficient multicast protocol using de Bruijn structure for mobile computing
ACM SIGCOMM Computer Communication Review
Efficient Routing and Sorting Schemes for de Bruijn Networks
IEEE Transactions on Parallel and Distributed Systems
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Fault-tolerant routing and multicasting in butterfly networks
Proceedings of the 1999 ACM symposium on Applied computing
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs
IEEE Transactions on Computers
A Versatile Architecture for the Distributed Sensor Integration Problem
IEEE Transactions on Computers
Fault-Tolerant de Bruijn and Shuffle-Exchange Networks
IEEE Transactions on Parallel and Distributed Systems
The Shuffle-Ring: Overcoming the Increasing Degree of Hypercube
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Turning the postal system into a generic digital communication mechanism
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
On de Bruijn Routing in Distributed Hash Tables: There and Back Again
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Bridging the digital divide: storage media + postal network = generic high-bandwidth communication
ACM Transactions on Storage (TOS)
Low Diameter Interconnections for Routing in High-Performance Parallel Systems
IEEE Transactions on Computers
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Efficient routing and broadcasting algorithms in de bruijn networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Fault free shortest path routing on the de bruijn networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Fault-tolerant diameter for three family interconnection networks
Journal of Combinatorial Optimization
A depth-first search routing algorithm for star graphs and its performance evaluation
Mathematical and Computer Modelling: An International Journal
The Hamiltonian property of linear functions
Operations Research Letters
| Hi-index | 15.02 |
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The underlying graph (to be called Shift and Replace graph or SRG) is based on DeBruijn digraphs and is a function of two parameters r and m. Pradhan and Reddy have shown that the node-connectivity of SRG is at least r. The same authors give a routing algorithm which generally requires 2m hops if the number of node failures is =(r -1). In this paper we show that the node-connectivity of SRG is (2r - 2). This would immediately imply that the system can tolerate up to (2r - 3) node failures. We then present routing methods for situations with a certain number of node failures. When this number is =(r - 2) our routing algorithm requires at most m + 3 + logr m hops if 3 + logr m =m. When the number of node failures is =(2r - 3) our routing algorithm requires at most m + 5 + logr m hops if 4 + logr m = m. In all the other situations our routing algorithm requires no more than 2m hops. The routing algorithms are shown to be computationally efficient.