A new method for MPLS-based recovery

Though there are many recovery schemes, and Makam scheme and Haskin scheme the most famous two, they have disadvantages such as bad expandability, low resource utilization and long service interrupt time. After studying the present recovery schemes, we propose a Reverse Recovery Tree scheme to handle fault recovery. In contrast to protecting one working LSP with one recovery LSP in the present recovery schemes, our scheme aims to protect the whole working LSP in the MPLS domain with only one Reverse Recovery Tree. Our scheme have merits of both Local Repair and Global Repair, thus it has good results in resource utilization and recovery time. It can guarantee single link or node failure recovery. Even when failures occur at both working LSP and recovery LSP, our scheme can also work well. Concurrent failure recovery is one of our scheme’s contributions.

[1]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Ezhan Karasan,et al.  Robust path design algorithms for traffic engineering with restoration in MPLS networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[3]  Ramki Krishnan,et al.  A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute , 2000 .

[4]  Radim Bartos,et al.  A heuristic approach to service restoration in MPLS networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[5]  Jordi Domingo-Pascual,et al.  Fast rerouting mechanism for a protected label switched path , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[6]  Changcheng Huang,et al.  Building reliable MPLS networks using a path protection mechanism , 2002, IEEE Commun. Mag..

[7]  Radim Bartos,et al.  Dynamic Issues in MPLS Service Restoration , 2002, IASTED PDCS.

[8]  Rajeev Rastogi,et al.  Algorithms for computing QoS paths with restoration , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Satish K. Tripathi,et al.  QoS aware path protection schemes for MPLS networks , 2002 .