Single backup table schemes for shortest-path routing

Theoretical Computer Science

Volumn 333, Issue 3, 2005, Pages 347-353

  Ito, Hiro ^a   Iwama, Kazuo ^a   Okabe, Yasuo ^a   Yoshihiro, Takuya ^b  

^a KYOTO UNIVERSITY   (Japan)

^b WAKAYAMA UNIVERSITY   (Japan)

Author keywords

Backup tables; Fault tolerance; Graph algorithms; Routing; Shortest paths; Swap edges

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SYSTEM RECOVERY; INTERNET; PACKET NETWORKS; PROBLEM SOLVING; ROUTERS; SYSTEMS ANALYSIS; TELECOMMUNICATION LINKS;

BACKUP TABLES; GRAPH ALGORITHMS; ROUTING; SHORTEST PATHS; SWAP EDGES;

COMPUTER NETWORKS;

EID: 13844280419     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.06.033     Document Type: Conference Paper

References (6)

1. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni Fully dynamic shortest paths in digraphs with arbitrary arc weights J. Algorithms 49 1 2003 86 113
2. H. Gabow, and R. Tarjan A linear-time algorithm for a special case of disjoint set union J. Comput. System Sci. 30 2 1985 209 221
3. H. Ito, K. Iwama, Y. Okabe, T. Yoshihiro, Polynomial-time computable backup tables for shortest-path routing, The 10th Internat. Colloq. on Structural Information and Communication Complexity (SIROCCO 2003), 2003, pp. 163-177.
4. E. Nardelli, G. Proietti, and P. Widmayer Swapping a failing edge of a single source shortest path tree is good and fast Algorithmica 35 1 2003 56 74
5. B. Schieber, and U. Vishkin On finding lowest common ancestors simplification and parallelization SIAM J. Comput. 17 1998 1253 1262
6. C. Zaroliagis, Implementations and experimental studies of dynamic graph algorithms, Experimental Algorithmics - From Algorithm Design to Robust and Efficient Software, Springer, 2002, pp. 229-278 (Chapter 11).