Space Efficient Edge-Fault Tolerant Routing

Varun Rajan, Marc Herbstritt
2012 Foundations of Software Technology and Theoretical Computer Science  
Let G be an undirected weighted graph with n vertices and m edges, and k ≥ 1 be an integer. We preprocess the graph in O(mn) 1 time, constructing a data structure of size O(k • deg(v) + n 1/k ) words per vertex v ∈ V , which is then used by our routing scheme to ensure successful routing of packets even in the presence of a single edge fault. The scheme adds only O(k) words of information to the message. Moreover, the stretch of the routing scheme, i.e., the maximum ratio of the cost of the
more » ... along which the packet is routed to the cost of the actual shortest path that avoids the fault, is only O(k 2 ). Our results match the best known results for routing schemes that do not consider failures, with only the stretch being larger by a small constant factor of O(k). Moreover, a 1963 girth conjecture of Erdős, known to hold for k = 1, 2, 3 and 5, implies that Ω(n 1+1/k ) space is required by any routing scheme that has a stretch less than 2k + 1. Hence our data structures are essentially space efficient. The algorithms are extremely simple, easy to implement, and with minor modifications, can be used under a centralized setting to efficiently answer distance queries in the presence of faults. An important component of our routing scheme that may be of independent interest is an algorithm to compute the shortest cycle passing through each edge. As an intermediate result, we show that computing this in a distributed model that stores at each vertex the shortest path tree rooted at that node requires Θ(mn) message passings in the worst case.
doi:10.4230/lipics.fsttcs.2012.350 dblp:conf/fsttcs/Rajan12 fatcat:jre5vgaspvfczmw5y2v3gbz4pu