A Survey on the Path Restoration in MPLS Networks

  • B. J. Ambika
  • N. Naga Maruthi Kumari
  • M. K. Banga
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 14)

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.

Keywords

MPLS Graph algorithms Fuzzy sets 

References

  1. 1.
    Jayakeshavan Veeraswamy, Venkateshan S (1994) Effect of traffic splitting on link and path restoration planning. Proceedings of IEEE 1994Google Scholar
  2. 2.
  3. 3.
  4. 4.
    Iraschko R, MacGregor M, Grover W (1996) Optimal capacity placement for path restoration in mesh sunkble networks. In: Proceedings of IEEE ICCGoogle Scholar
  5. 5.
    Kodialam M, Lakshman TV. Dynamic routing of bandwidth guaranteed multicasts with failure backup. Bell Labs, Lucent Technologies Holmdel, NJ 07733Google Scholar
  6. 6.
    Zagozdzon M, Masteusz, Pioro M (2007) Traffic flow optimization in networks with combined OSPF/MPLS routing. In: An international conference IEEE-2007Google Scholar
  7. 7.
    Li G, Wang D, Kalmanek C (2003) Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Trans Netw 11(5)Google Scholar
  8. 8.
    Bejerano Y, Breitbart Y, Orda A, Rastogi R, Sprintson A (2005) Algorithms for computing QoS paths with restoration. IEEE/ACM Trans Netw 13(3)Google Scholar
  9. 9.
    Hanshi SM, Al-Khateeb W (2010) Enhancing QOS protection in MPLS networks. In: IEEE-2010, 2nd international conference on network applications, protocols and servicesGoogle Scholar
  10. 10.
    Todd B, Doucette J. Fast efficient design of shared backup path protected networks using a multi-flow optimization model. Student Member, IEEEGoogle Scholar
  11. 11.
    Kakuda Y, Nagano SI, Kikuno T, Terabe M. Reservation for rapid restoration using multiagentsGoogle Scholar
  12. 12.
    Busche MT, Lochart CM, OlsZewski C (1994) Dynamic K-shortest path facility restoration algorithm. IEEEGoogle Scholar
  13. 13.
    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 2003Google Scholar
  14. 14.
    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–44Google Scholar
  15. 15.
    Kodialam MS, Lakshman TV (2000) Dynamic routing of bandwidth guaranteed tunnels with restoration. INFOCOM 2:902–911Google Scholar
  16. 16.
    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

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • B. J. Ambika
    • 1
    • 2
    • 3
  • N. Naga Maruthi Kumari
    • 1
    • 2
    • 3
  • M. K. Banga
    • 1
    • 2
    • 3
  1. 1.School of Computing and Information TechnologyREVA UniversityBengaluruIndia
  2. 2.Department of Computer Science & EngineeringDayananda Sagar UniversityCoimbatoreIndia
  3. 3.Department of R&DBharathiar UniversityCoimbatoreIndia

Personalised recommendations