Advertisement

k-pairwise cluster fault tolerant routing in hypercubes

  • Qian-Ping Gu
  • Shietung Peng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)

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 n-dimensional hypercubes Hn. We give an O(n2 log n) time algorithm for k-pairwise CFT routing in Hn. Our algorithm imply an O(n2 log n) 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 are 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Q. Gu and S. Peng. Efficient algorithms for disjoint paths in star graphs. Technical Report 93-1-015, Univ. of Aizu, Japan, Aizuwakamatsu, Fukushima, 965-80, Japan, 1993. To appear in 6th International Transputer/Occam Conference.Google Scholar
  2. [2]
    Q. Gu and S. Peng. k-pairwise cluster fault tolerant routing in hypercubes and star graphs. Technical Report 94-1-021, Univ. of Aizu, Japan, Aizuwakamatsu, Fukushima, 965-80, Japan, 1994.Google Scholar
  3. [3]
    D. F. Hsu. On container with width and length in graphs, groups, and networks. IEICE Trans. on Fundamental of Electronics, Information, and Computer Sciences, To appear in April, 1994.Google Scholar
  4. [4]
    R. M. Karp. On the computational complexity of combinatorial problems. Networks, pages 45–68.Google Scholar
  5. [5]
    S. Madhavapeddy and I. H. Sudborough. A topological property of hypercubes: Node disjoint paths. In Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, pages 532–539, 1990.Google Scholar
  6. [6]
    J. McHugh. Algorithmic Graph Theory. Prentice-Hall Inc., 1990.Google Scholar
  7. [7]
    Y. Saad and M. H. Shultz. Topological properties of hypercubes. IEEE Trans. on Computers, pages 867–872, 1988.Google Scholar
  8. [8]
    C. L. Seitz. The cosmic cube. Communication of ACM, pages 22–33, 1985.Google Scholar
  9. [9]
    Y. Shiloach. The two paths problem is polynomial. Technical Report STAN-CS-78-654, Stanford University.Google Scholar
  10. [10]
    M. Watkin. On the existence of certain disjoint arcs in graphs. Duke Math, Journal, 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Qian-Ping Gu
    • 1
  • Shietung Peng
    • 1
  1. 1.Department of Computer SoftwareThe University of AizuFukushimaJapan

Personalised recommendations