Abstract
We study the problem of designing fault-tolerant routings for a communication network which is a triconnected planar network of processors in the surviving route graph model. The surviving route graph for a graph G, a routing ρ anda set of faults F is a directed graph consisting of nonfaulty nodes with a directed edge from a node x to a node y iff there are no faults on the route from x to y. The diameter of the surviving route graph couldb e one of the fault-tolerance measures for the graph G andt he routing ρ. In this paper, we show that we can construct a routing for any triconnectedpl anar graph with a triangle face such that the diameter of the surviving route graphs is two(thus optimal) for any faults F(|F| ≤ 2). We also show that the optimal routing can be computedin linear time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Broder, D. Dolev, M. Fischer and B. Simons: “Efficient Fault Tolerant Routing in Network,” Information and Computation 75,52–64(1987). 191
D. Dolev, J. Halpern, B. Simons and H. Strong: “A New Look at Fault Tolerant Routing,” Information and Computation 72,180–196(1987). 191
P. Feldman: “Fault Tolerance of Minimal Path Routing in a Network,” Proc. 17th ACM STOC,pp.327–334(1985). 191
F. Harary, Graph Theory, Addison-Wesley, Reading, MA (1969). 192
G. Kant: “Drawing Planar Graphs Using the Canonical Ordering,” Algorithmica, 16, 1, 4–32 (1996). 192, 195, 196
K. Kawaguchi and K. Wada: “New Results in Graph Routing,” Information and Computation, 106, 2, 203–233 (1993). 191
D. Peleg and B. Simons: “On Fault Tolerant Routing in General Graph,” Information and Computation 74,33–49(1987). 191
K. Wada and K. Kawaguchi: “Efficient Fault-Tolerant FixedR outings on (k + 1)-connectedDi graphs,” Discrete Applied Mathematics, 37/38, 539–552 (1992). 191
K. Wada, Y. Luo and K. Kawaguchi: “Optimal Fault-Tolerant Routings for Connected Graphs,” Information Processing Letters, 41, 3, 169–174 (1992). 192
K. Wada, W. Chen, Y. Luo and K. Kawaguchi: “Optimal Fault-Tolerant ATM-routings for Biconnected Graphs,” The 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1335, 354–367 (1997). 191, 192
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wada, K., Nagata, Y., Chen, W. (1999). An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science. WG 1999. Lecture Notes in Computer Science, vol 1665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46784-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-46784-X_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66731-5
Online ISBN: 978-3-540-46784-7
eBook Packages: Springer Book Archive