Abstract
In order to provide uninterrupted services whenever a node or link in the network fails, fast recovery techniques are required. Multi Protocol Label Switching (MPLS) is a very popular technique that applies recovery mechanism to such failure. Algorithms and graph theory have been well researched areas of research. Graph theoretic concepts and algorithms play important role in MPLS networks. The aim of this survey is to discuss a different recovery techniques, advantages and disadvantages of various path restoration techniques.
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
References
Jayakeshavan Veeraswamy, Venkateshan S (1994) Effect of traffic splitting on link and path restoration planning. Proceedings of IEEE 1994
Iraschko R, MacGregor M, Grover W (1996) Optimal capacity placement for path restoration in mesh sunkble networks. In: Proceedings of IEEE ICC
Kodialam M, Lakshman TV. Dynamic routing of bandwidth guaranteed multicasts with failure backup. Bell Labs, Lucent Technologies Holmdel, NJ 07733
Zagozdzon M, Masteusz, Pioro M (2007) Traffic flow optimization in networks with combined OSPF/MPLS routing. In: An international conference IEEE-2007
Li G, Wang D, Kalmanek C (2003) Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Trans Netw 11(5)
Bejerano Y, Breitbart Y, Orda A, Rastogi R, Sprintson A (2005) Algorithms for computing QoS paths with restoration. IEEE/ACM Trans Netw 13(3)
Hanshi SM, Al-Khateeb W (2010) Enhancing QOS protection in MPLS networks. In: IEEE-2010, 2nd international conference on network applications, protocols and services
Todd B, Doucette J. Fast efficient design of shared backup path protected networks using a multi-flow optimization model. Student Member, IEEE
Kakuda Y, Nagano SI, Kikuno T, Terabe M. Reservation for rapid restoration using multiagents
Busche MT, Lochart CM, OlsZewski C (1994) Dynamic K-shortest path facility restoration algorithm. IEEE
Dana A, Khadem A, Badie K, Kalanatari ME, Reyhani N (2003) LSP restoration in MPLS network using case-based reasoning approach. In: Proceedings of ICCT 2003
Zadeh LA (1973) Outline of a new approach to the analysis of complex systems and decision processes. IEEE Trans Syst Man Cybern SMC-S(1) 28–44
Kodialam MS, Lakshman TV (2000) Dynamic routing of bandwidth guaranteed tunnels with restoration. INFOCOM 2:902–911
Jamoussi B, Andersson L, Callon R, Dantu R, Wu L, Doolan P, Worster T, Feldman N, Fredette A, Girish M, Kilty T, Malis A (2002) Constraintbased LSP setup using LDP. Jan 2002, RFC 3212. http://www.ietf.org/rfc/rfc3212.txt
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
See Table 1.
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ambika, B.J., Naga Maruthi Kumari, N., Banga, M.K. (2018). A Survey on the Path Restoration in MPLS Networks. In: Guru, D., Vasudev, T., Chethan, H., Kumar, Y. (eds) Proceedings of International Conference on Cognition and Recognition . Lecture Notes in Networks and Systems, vol 14. Springer, Singapore. https://doi.org/10.1007/978-981-10-5146-3_4
Download citation
DOI: https://doi.org/10.1007/978-981-10-5146-3_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-5145-6
Online ISBN: 978-981-10-5146-3
eBook Packages: EngineeringEngineering (R0)