K-pairwise cluster fault tolerant routing in hypercubes

• Published in: IEEE transactions on computers 1997-09, Vol.46 (9), p.1042-1049
• Main Authors: GU, Q.-P, PENG, S
• Format: Article
• Language: English
• Subjects: Applied sciences; Clustering algorithms; Computer networks; Computer science; control theory; systems; Computer systems performance. Reliability; Exact sciences and technology; Fault tolerance; Frequency; Hypercubes; Multiprocessor interconnection networks; Optical fibers; Routing; Software; Telecommunication network reliability; Very large scale integration
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/12.620486

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).