Abstract
This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and preprovisioned backup LSPs, which consists of two subsequent algorithms. The first algorithm for the dynamic deterimination of the restoration scope (RS)increases the restoration speed by minimizing the complexity of the network topology and by maximizing the reusability of the existing working LSP. The second newly proposed concept of RS extension minimizes the probability of restoration failure by dynamically widening the restoration scope until the RS is equal to the whole network topology. Through simulation, we evaluate the performance of our restoration scheme and the existing protection schemes in terms of the restoration speed, packet loss, network resource utilization, and resource reusability of the existing working LSP.
This work was supported by University ITRC Project of MIC. Dr. C.S. Hong is the corresponding author.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. IETF RFC3031 (2001)
Awduche, D., Malcolm, J.J., Agogbua, J., O’Dell, M., McNabus, J.: Requirements for Traffic Engineering over MPLS. IETF RFC2702 (1999)
Awduche, D., et al.: Requirements for Traffic Engineering Over MPLS. IETF REC 2702 (1999)
Huang, C., Shrma, V., Makam, S., Owens, K.: A Path Protection/Restoration Mechanism for MPLS Networks. Internet Draft, draft-chang-mpls-pathprotection- 02.txt (2000)
Haskin, D., Krishnan, R.: A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute. Internet Draft, draft- haskin-mpls-fast-reroute- 05.txt (2000)
Sharma, V., Crane, B.M., Owens, K., Huang, C., Hellstrand, F., Cain, B., Civanlar, S., Chiu, A.: Framework for MPLS-based Recovery. Internet Draft, draft-ietfmpls- recovery-frmwrk-03.txt (2001)
Huang, C., Sharma, V., Owens, K., Makam, S.: Building Reliable MPLS Networks Using a Path Protection Mechanism. IEEE Communications Magazine, 156–162 (March 2002)
Ahn, G., Chun, W.: MPLS Restoration Using Least-Cost Based Dynamic Backup Path. In: Lorenz, P. (ed.) ICN 2001. LNCS, vol. 2094, pp. 319–328. Springer, Heidelberg (2001)
Harrison, E., Farrel, A., Miller, B.: Protection and Restoration in MPLS Networks. Data Connection (October 2001), http://www.dataconnection.com
Helsinki University of Technology, QoS Routing Simulator (QRS) Version2.0, Available at http://www.tct.hut.fi/pgzhang/QRS/index.html
Ahn, G., Jang, J.: An Efficient Rerouting Scheme for MPLS-based Recovery and Its Performance Evaluations. Telecommuincation Systems 3, 481–495 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, D.WK., Hong, C.S. (2005). A Rerouting Scheme with Dynamic Control of Restoration Scope for Survivable MPLS Network. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-30582-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24467-7
Online ISBN: 978-3-540-30582-8
eBook Packages: Computer ScienceComputer Science (R0)