RSVP Based Critical Services Path Recovery in MPLS Network

The purpose of this paper is to introduce 2 new RSVP-TE objects which helps in establishing a recovery path which is good enough to handle the existing traffic. These 2 new objects are added into native RSVP path message. Dijkstra´s algorithm (N. Drakos, 1997) is used to find the shortest path on an OSPF network. The process of establishing the new backup path is triggered in a few minutes after the working path has been successfully established. To create a new backup path, the modified RSVP path message is sent downstream from ingress LSR to egress LSR. RESV message is then sent back upstream from egress LSR to ingress LSR along the same route. The simulation shows that the new backup path has a hop number which is less than or equal to that of the working path. The new backup path also has less bandwidth than the working path but the bandwidth is still sufficient to handle the current traffic