|
SIGMETRICS 2001 / Performance 2001Restoration by Path Concatenation: Fast Recovery of MPLS Paths |
| Authors |
|
Yehuda Afek Tel-Aviv University
Anat Bremler-Barr
Edith Cohen
Haim Kaplan
Michael Merritt |
| Abstract |
|
A new general theory about restoration of network paths is first
introduced. The theory pertains to restoration of shortest paths
in a network following failure, e.g., we prove that a shortest
path in a network after removing k edges is the concatenation of
at most k+1 shortest paths in the original network.
The theory is then combined with efficient path concatenation techniques in MPLS (multi-protocol label switching), to achieve powerful schemes for restoration in MPLS based networks. We thus transform MPLS into a flexible and robust method for forwarding packets in a network. |