Restoration Path Concatenation: Fast recovery of MPLS paths

Anat Bremler-Barr*, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)316-317
Number of pages2
JournalPerformance Evaluation Review
Issue number1
StatePublished - 2001
EventJoint International Conference on Measurement and Modeling of Computer Systems - Cambridge, MA, United States
Duration: 16 Jun 200120 Jun 2001


Dive into the research topics of 'Restoration Path Concatenation: Fast recovery of MPLS paths'. Together they form a unique fingerprint.

Cite this