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

ACM PODC,

2001

Conferences & Workshops

Routing

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.

DEEPNESS Lab 2022 © all rights reserved