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.
Unable to display preview. Download preview PDF.
- 4.S. Cicerone and G. Di Stefano. Graphs with bounded induced distance. In Proceedings 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG’98, pages 177–191. Springer-Verlag, Lecture Notes in Computer Science, vol. 1517, 1998.Google Scholar
- 5.S. Cicerone, G. Di Stefano, and D. Handke. Survivable Networks with Bounded Delays. Technical Report, Konstanzer Schriften in Mathematik und Informatik n. 81, University of Konstanz, Germany, February 1999.Google Scholar
- 7.M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP Completeness. W H Freeman & Co Ltd, 1979.Google Scholar
- 8.D. Handke. Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees (extended abstract). In Proceedings 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG’98, pages 203–214. Springer-Verlag, Lecture Notes in Computer Science, vol. 1517, 1998.Google Scholar
- 11.F. T. Leighton. Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufman Publishers, 1992.Google Scholar
- 14.A. L. Rosenberg. Cycles in networks. Technical Report UM-CS-1991-020, Dept. of Computer and Information Science, Univ. of Massachusetts, 1991.Google Scholar