Communications of the ACM - Special section on computer architecture
Topological Properties of Hypercubes
IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Algorithmic graph theory
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The two paths problem is polynomial
The two paths problem is polynomial
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
Complexity of pairwise shortest path routing in the grid
Theoretical Computer Science
Fault-tolerant routing in mesh-connected 2D tori
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
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
k-pairwise disjoint paths routing in perfect hierarchical hypercubes
The Journal of Supercomputing
| Hi-index | 14.99 |
In this paper, we introduce a general fault tolerant routing problem, cluster fault tolerant routing, which is a natural extension of the well studied node fault tolerant routing problem. A cluster is a connected subgraph of a graph G, and a cluster is faulty if all nodes in it are faulty. In cluster fault tolerant routing (abbreviated as CFT routing), we are interested in the number of faulty clusters and the size of the clusters that an interconnection network can tolerate for certain routing problems. As a case study, we investigate the following k-pairwise CFT routing in n-dimensional hypercubes Hn: Given a set of faulty clusters and k distinct nonfaulty node pairs (s1, t1), ..., (sk, tk) in Hn, find k fault-free node-disjoint paths si驴ti, 1 驴i驴k. We show that Hn can tolerate n驴 2 faulty clusters of diameter one, plus one faulty node for the k-pairwise CFT routing with k = 1. For n驴 4 and $2 \le k \le \lceil n/2 \rceil,$ we prove that Hn can tolerate n驴 2k + 1 faulty clusters of diameter one for the k-pairwise CFT routing. We also give an O(kn log n) time algorithm which finds the k paths for the mentioned problem. Our algorithm implies an O(n2 log n) time algorithm for the k-pairwise node-disjoint paths problem in Hn, which improves the previous result of O(n3 log n).