Sciweavers

Share
SIROCCO
2003

Polynomial-Time Computable Backup Tables for Shortest-Path Routing

9 years 2 months ago
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
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SIROCCO
Authors Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
Comments (0)
books