TY - JOUR

T1 - Restoration by path concatenation

T2 - Fast recovery of MPLS paths

AU - Afek, Yehuda

AU - Bremler-Barr, Anat

AU - Kaplan, Haim

AU - Cohen, Edith

AU - Merritt, Michael

PY - 2002/12

Y1 - 2002/12

N2 - 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. Finally, the different schemes suggested are evaluated experimentally on three large networks (a large ISP, the AS graph of the Internet, and the full Internet topology). These experiments demonstrate that the restoration schemes perform well in actual topologies.

AB - 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. Finally, the different schemes suggested are evaluated experimentally on three large networks (a large ISP, the AS graph of the Internet, and the full Internet topology). These experiments demonstrate that the restoration schemes perform well in actual topologies.

KW - MPLS

KW - OSPF

KW - Restoration

KW - Shortest-path problem

UR - http://www.scopus.com/inward/record.url?scp=0036944179&partnerID=8YFLogxK

U2 - 10.1007/s00446-002-0080-6

DO - 10.1007/s00446-002-0080-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036944179

SN - 0178-2770

VL - 15

SP - 273

EP - 283

JO - Distributed Computing

JF - Distributed Computing

IS - 4 (Special issue: PODC'01)

ER -