Survivable Networks with Bounded Delay: The Edge Failure Case

We introduce new classes of graphs to investigate networks that guarantee constant delays even in the case of multiple edge failures. This means the following: as long as two vertices remain connected if some edges have failed, then the distance between these vertices in the faulty graph is at most a constant factor k times the original distance. In this extended abstract, we consider the case where the number of edge failures is bounded by a constant l. These graphs are called (k, l)- self-spanners. We prove that the problem of maximizing l for a given graph when k > 4 is fixed is NP-complete, whereas the dual problem of minimizing k when l is fixed is solvable in polynomial time. We show how the Cartesian product affects the self-spanner properties of the composed graph. As a consequence, several popular network topologies (like grids, tori, hypercubes, butterflies, and cube-connected cycles) are investigated with respect to their self-spanner properties.

[1]  Dagmar Handke,et al.  Survivable Networks with Bounded Delay , 1998 .

[2]  Alon Itai,et al.  The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.

[3]  D. Handke.  Independent Tree Spanners , 1998, WG.

[4]  Ting-Yi Sung,et al.  Multiple-Edge-Fault Tolerance with Respect to Hypercubes , 1997, IEEE Trans. Parallel Distributed Syst..

[5]  Marie-Claude Heydemann,et al.  Spanners of Hypercube-Derived Networks , 1996, SIAM J. Discret. Math..

[6]  Arnold L. Rosenberg,et al.  Cycles in Networks , 1991 .

[7]  Jehoshua Bruck,et al.  Fault-Tolerant Meshes with Small Degree , 1997, SIAM J. Comput..

[8]  F. Thomson Leighton,et al.  ARRAYS AND TREES , 1992 .

[9]  Arnold L. Rosenberg,et al.  Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..

[10]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[11]  Bruce M. Maggs,et al.  Reconfiguring Arrays with Faults Part I: Worst-Case Faults , 1997, SIAM J. Comput..

[12]  Bruce M. Maggs,et al.  On the Fault Tolerance of Some Popular Bounded-Degree Networks , 1998, SIAM J. Comput..

[13]  Fred S. Annexstein.  Fault tolerance in hypercube-derivative networks (preliminary version) , 1991, CARN.

[14]  Serafino Cicerone,et al.  Graphs with bounded induced distance , 1998, Discret. Appl. Math..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[17]  Fred S. Annexstein.  Fault tolerance in hypercube-derivative networks , 1989, SPAA '89.