Single backup table schemes for shortest-path routing

Authors:
Hiro Ito;Kazuo Iwama;Yasuo Okabe;Takuya Yoshihiro
Affiliations:
School of Informatics, Kyoto University, Yoshida-Honmachi, Kyoto, Japan;School of Informatics, Kyoto University, Yoshida-Honmachi, Kyoto, Japan;Academic Center for Computing and Media Studies, Kyoto University, Yoshida-Honmachi, Kyoto, Japan;Faculty of Systems Engineering, Wakayama University, Wakayama, Japan
Venue:
Theoretical Computer Science - Foundations of software science and computation structures
Year:
2005

Citing 3
Cited 4

On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics
Fully dynamic shortest paths in digraphs with arbitrary arc weights

Journal of Algorithms

Computing all the best swap edges distributively

Journal of Parallel and Distributed Computing
Faster Swap Edge Computation in Minimum Diameter Spanning Trees

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new recovery scheme that needs only one extra backup routing table for networks employing shortest-path routing. By precomputing this backup table, the network recovers from any single link failure immediately after the failure occurs. To compute the backup routing table for this scheme, we use an almost linear time algorithm to solve the {r, v}-problem, which is a variation of the best swap problem presented by Nardelli et al. We further show that the same solution can be computed in exactly linear time if the underlying graph is unweighted.