Restoration by path concatenation: Fast recovery of MPLS paths

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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. 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.

Original languageEnglish
Pages (from-to)273-283
Number of pages11
JournalDistributed Computing
Issue number4 (Special issue: PODC'01)
StatePublished - Dec 2002


  • MPLS
  • OSPF
  • Restoration
  • Shortest-path problem


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

Cite this