Elsevier

Discrete Applied Mathematics

Volumes 37–38, 15 July 1992, Pages 539-552
Discrete Applied Mathematics

Efficient fault-tolerant fixed routings on (k+1)-connected digraphs

https://doi.org/10.1016/0166-218X(92)90157-6Get rights and content
Under an Elsevier user license
open archive

Abstract

Consider a directed communication network G in which a limited number of directed link and/or node faults F might occur. A routing ϱ for the network (a fixed path for each ordered pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G,ϱ)F (denoted by D(R(G,ϱ)F)), where two nonfaulty nodes x and y are connected by a directed edge if 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 sufficient conditions for classes of (k+1)-connected directed graphs to have routings ϱ3 and ϱ2 on G such that D(R(G,ϱ3)F)≤3 and D(R(G,ϱ2)F)<2 for any set faults F(|ϱ,≤k). Since the diameter of the surviving route graph is more than 1 provided that faults are assumed to occur in the network, we insist that the routing ϱ2 is optimal. We also show that constant diameter routings (with the diameters of the surviving route graph being 5 and 7) can be constructed for any (k+1)-connected digraph satisfying only a certain size condition.

Cited by (0)