Fault tolerance of minimal path routings in a network
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A new look at fault-tolerant network routing
Information and Computation
On fault tolerant routings in general networks
Information and Computation
Efficient fault—tolerant routings in networks
Information and Computation
Efficient fault-tolerant fixed routings on (k+1)-connected digraphs
Discrete Applied Mathematics - Special double volume: interconnection networks
Optimal fault-tolerant routings for connected graphs
Information Processing Letters
Information and Computation
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We study the problem of designing fault-tolerant routings for a communication network which is a triconnectedpl anar network of processors in the surviving route graph model. The surviving route graph for a graph G, a routing ρ and a 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 could be 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.