k-Pairwise cluster fault tolerant routing in hypercubes

Abstract

In this paper, we introduce a general fault-tolerant routing problem, CFT routing, which is a natural extension of the well studied node fault tolerant routing problem, and give some CFT properties about k-pairwise CFT routing in ndimensional hypercubes Hn. We give an O(n2 log n) time algorithm for k-pairwise CFT routing in Hn. Our algorithm imply an O(n2 logn) algorithm for k-pairwise node disjoint path problem in Hn. The algorithm for k-pairwise node disjoint path problem in Hn significantly improves the previous results of time complexity O(n3 log n). As an extension of the fault diameter, we define cluster fault diameter for interconnection networks and prove the cluster fault diameter of Hn is n + 2 when the diameters of the fault clusters axe at most 1. We also show an O(n) time algorithm which finds a path of length at most n + 3 for node-to-node CFT routing (k-pairwise CFT routing with k = 1) in Hn.