ACM Home
IFIP Home
----
SIGMETRICS 2001 / Performance 2001 Home
Call for Papers
Organizing Committee
Technical Program Committee
Registration Information
Advanced Technical Program
Tutorials
Workshops
Travel Support for Students
Travel Related Information
Other Links of Interest
----

 

SIGMETRICS 2001 / Performance 2001

Restoration by Path Concatenation: Fast Recovery of MPLS Paths

Authors
Yehuda Afek
Tel-Aviv University

Anat Bremler-Barr
Tel-Aviv University

Edith Cohen
AT&T Labs Research

Haim Kaplan
Tel-Aviv University

Michael Merritt
AT&T Labs Research
 

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.


[Last updated Fri Mar 23 2001]