k-Pairwise Cluster Fault Tolerant Routing in Hypercubes

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 H/sub n/: Given a set of faulty clusters and k distinct nonfaulty node pairs (s/sub 1/, t/sub 1/), ..., (s/sub k/, t/sub k/) in H/sub n/, find k fault-free node-disjoint paths s/sub i//spl rarr/t/sub i/, 1/spl les/i/spl les/k. We show that H/sub n/ can tolerate n-2 faulty clusters of diameter one, plus one faulty node for the k-pairwise CFT routing with k=1. For n/spl les/4 and 2/spl les/k/spl les/[n/2], we prove that H/sub n/ 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(n/sup 2/ log n) time algorithm for the k-pairwise node-disjoint paths problem in H/sub n/, which improves the previous result of O(n/sup 3/ log n).

[1]  Y. Shiloach.  The two paths problem is polynomial , 1978 .

[2]  Cauligi S. Raghavendra,et al.  Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

[3]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[4]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[5]  Mark E. Watkins.  On the existence of certain disjoint arcs in graphs , 1968 .

[6]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

[7]  Yuh-Dauh Lyuu,et al.  A graph-theoretical study of transmission delay and fault tolerance , 1994 .

[8]  Yossi Shiloach,et al.  A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.

[9]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[10]  Jean-Claude Bermond.  Interconnection Networks , 1992 .

[11]  Shietung Peng,et al.  An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters , 1996, Comput. J..

[12]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[13]  Shahram Latifi.  Combinatorial Analysis of the Fault-Diameter of the n-cube , 1993, IEEE Trans. Computers.

[14]  Ivan Hal Sudborough,et al.  A topological property of hypercubes: node disjoint paths , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[15]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.