Advertisement

Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs

  • Koichi Wada
  • Takaharu Ikeo
  • Kimio Kawaguchi
  • Wei Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)

Abstract

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ρ for the network(a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F, where the surviving route graph R(G, ρ)/F is a directed graph consisting of all nonfaulty nodes in G with a directed edge from x to y iff there are no faults on the route from x to y, could be one of the fault-tolerant measures for the routing ρ. In this paper, we show that we can construct efficient and highly fault-tolerant routings on a k-dimensional generalized d-hypercube C(d, k) such that the diameter of the surviving route graph is bounded by constant for the case that the number of faults exceeds the connectivity of C(d, k).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.Broder, D.Dolev, M.Fischer and B.Simons, ”;Efficient fault tolerant routing in network,”; Information and Computation75, 1, pp.52–64(Oct. 1987).Google Scholar
  2. 2.
    D.Dolev, J.Halpern, B.Simons and H.Strong, ”;A new look at fault tolerant routing, ”; Information and Computation72,3,pp.180–196(Oct. 1987).Google Scholar
  3. 3.
    A.-H.Esfahanian, ”;Generalized measures of fault tolerance with application to n-cube networks,”; IEEE Trans. on Computers38, 11, pp.1585–1591(1989).Google Scholar
  4. 4.
    A.-H.Esfahanian and S.L.Hakimi, ”;On computing a conditional edge-connectivity of a graph,”; Information Processing Letters, 27, pp.195–199(1988).Google Scholar
  5. 5.
    P.Feldman, ”;Fault tolerance of minimal path routing in a network,”; Proc. of ACM 17th STOC,pp.327–334(May 1985).Google Scholar
  6. 6.
    F.Harary, Graph theory, Addison-Wesley, Reading, MA (1969).Google Scholar
  7. 7.
    F.Harary, ”;Conditional connectivity,”; Networks, 13, pp.346–357(1983).Google Scholar
  8. 8.
    K.Kawaguchi and K.Wada, ”;New Results in Graph Routing,”; Information and Computation 106, 2, pp.203–233(1993).Google Scholar
  9. 9.
    S.Latifi, ”;Combinatorial analysis of the fault-diameter of the n-cube,”; IEEE Trans. on Computers 42, 1, pp.27–33(1993).Google Scholar
  10. 10.
    D.Peleg and B.Simons, ”;On fault tolerant routing in general graph,”; Information and Computation 74, 1, pp.33–49(Jul. 1987).Google Scholar
  11. 11.
    K.Wada, K.Kawaguchi and H.Fujishima, ”;A New Measure of Fault-Tolerance for Interconnection Networks,”; Proceeding of 1990 BILKENT International Conference on New Trends in Communication, Control and Signal Processing, pp.111–118(1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Koichi Wada
    • 1
  • Takaharu Ikeo
    • 1
  • Kimio Kawaguchi
    • 1
  • Wei Chen
    • 1
  1. 1.Nagoya Institute of TechnologyNagoyaJapan

Personalised recommendations