Abstract
The path restoration in MPLS is the technique to reroute traffic around a failure in a LSP. The existing path restoration schemes have some difficulty in solving problem such as resource utilization and protection of backup path. This paper proposes a dynamic path restoration scheme using the least-cost based backup path, which may increase resource utilization and protect backup path without requiring longer restoration times. In the proposed scheme, each node on working path has candidate nodes that may become an egress node of backup path. The node that detects a failure finds a node out of the candidate nodes that is used as splicing node of backup path at the lease cost. And then it establishes new backup path up to the node in order to reroute traffic on working path to the backup path. Through simulation, the performance of the proposed scheme is measured and compared with the existing scheme in terms of packet loss, re-ordering of packets, concurrent faults, and resource utilization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bilel Jamoussi, “Constraint-Based LSP Setup using LDP,” Internet Draft, Oct. 1999.
Changcheng Huang, Vishal Sharma, Srinivas Makam, Ken Owens, “A Path Protection/Restoration Mechanism for MPLS Networks,” Internet Draft, July 2000.
Daniel O. Awduche, Lou Berger, Der-Hwa Gan, Tony Li, Vijay Srinivasan, George Swallow, “RSVP-TE: Extensions to RSVP for LSP Tunnels”, draft-ietf-mpls-rsvp-lsptunnel-08.txt, Feb. 2001
Dimitry Haskin, Ram Krishnan, “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute,” Internet Draft, May 2000.
Eric C. Rosen, Arun Viswanathan, Ross Callon, “Multiprotocol Label Switching Architecture,” Internet Draft, April 1999.
Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda, “QoS Routing Mechanisms and OSPF Extensions,” RFC2676, August 1999.
Gaeil Ahn and Woojik Chun, “Design and Implementation of MPLS Network Simulator Supporting LDP and CR-LDP,” IEEE International Conference on Networks(ICON2000), Singapore, Sep. 2000, pp. 441–446
Hae-Joon Shin, Youn-Ky Chung, Young-Tak Kim, “A Restoration Scheme for MPLS Transit Network of Next Generation Internet,” in Proceeding of the 14th ICOIN, Taiwan, Jan. 2000, pp. 3D1.1–3D1.5.
Loa Andersson, Brad Cain, Bilel Jamoussi, “Requirement Framework for Fast Re-route with MPLS,” Internet Draft, June 1999.
Nortel Networks, Ennovate Networks, IBM Corp, Cisco Systems, “LDP Specification,” Internet Draft, June 1999.
Q. Ma and P. Steenkiste, “ On Path Selection for Traffic with Bandwidth Guarantees,” In Proc. of IEEE International Conference on Network Protocols(ICNP), Oct. 1997.
R. Callon at al., “A Framework for Multiprotocol Label Switching,” Internet Draft, Sep. 1999.
Tellabs, Nortel Networks, AT&T Labs, “Framework for MPLS Based Recovery,” Internet Draft, March 2000.
Z. Wang and J. Crowcroft, “Quality of Service Routing for Supporting Multimedia Applications,” IEEE JSAC, 14(7):1228–1234, Sep. 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, G., Chun, W. (2001). MPLS Restoration Scheme Using Least-Cost Based Dynamic Backup Path. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_32
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive