Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1)
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
Embedding trees in a hypercube is NP-complete
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A fault-tolerant communication scheme for hypercube computers
IEEE Transactions on Computers
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE Transactions on Computers
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes
IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
Journal of Parallel and Distributed Computing
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant multicasting in hypercubes using local safety information
Journal of Parallel and Distributed Computing
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant routing in mesh-connected 2D tori
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A clustering model for multicast on hypercube network
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Reliable networks with unreliable sensors
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Binomial-tree fault tolerant routing in dual-cubes with large number of faulty nodes
CIS'04 Proceedings of the First international conference on Computational and Information Science
Clustering multicast on hypercube network
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Online adaptive fault-tolerant routing in 2d torus
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Upper bounds on the connection probability for 2-D meshes and tori
Journal of Parallel and Distributed Computing
Fault tolerant routing algorithm in hypercube networks with load balancing support
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Broadcast in the locally k-subcube-connected hypercube networks with faulty tolerance
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 14.98 |
We study hypercube networks with a very large number of faulty nodes. A simple and natural condition, the local subcube-connectivity, is identified under which hypercube networks with a very large number of faulty nodes still remain connected. The condition of local subcube-connectivity can be detected and maintained in a distributed manner based on localized management. Efficient routing algorithms on locally subcube-connected hypercube networks are developed. Our algorithms are distributed and local-information-based in the sense that each node in the network knows only its neighbors' status and no global information of the network is required by the algorithms. For a locally subcube-connected hypercube network that may contain up to 37.5 percent faulty nodes, our algorithms run in linear time and, for any two given nonfaulty nodes, find a routing path of length bounded by four times the Hamming distance between the two nodes. Theoretical analysis and experimental results are presented which show that, under a variety of probability distributions of node failures, hypercube networks are locally subcube-connected with a very high probability and our routing algorithms run in linear time and construct routing paths of nearly optimal length.