Polynomial-Time Computable Backup Tables for Shortest-Path Routing

For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers from any single link-failure immediately after the failure occurs. It is shown that this scheme always works if the network is given as a two-edge-connected symmetric digraph and that an optimal backup table can be computed in time O  ¢¡ V ¡£¡ E ¡ ¤ . Furthermore, this time complexity can be reduced to linear if all edges of the graph have the same cost. Keywords routing, shortest paths, fault tolerance, backup tables, graph algorithms

• Type: Conference
• Year: 2003
• Where: SIROCCO
• Authors: Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
• Keywords: Backup Routing Table, Backup Tables, Optimal Backup Table, SIROCCO 2003, SIROCCO 2007