RSVP Based Critical Services Path Recovery in MPLS Network

Author

Siriakkarap, Chutipon ; Setthawong, Pisai ; Tanterdtid, Surat

Author_Institution

Dept. of Telecommun. Sci., Assumption Univ.

fYear

2005

fDate

10-10 Nov. 2005

Firstpage

405

Lastpage

408

Abstract

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

Keywords

multimedia communication; multiprotocol label switching; telecommunication network routing; telecommunication traffic; virtual private networks; Dijkstra algorithm; MPLS network; OSPF network; RSVP based critical services path recovery; RSVP-TE objects; backup path; egress LSR; hop number; ingress LSR; modified RSVP path message; working path; Bandwidth; Fault detection; Intelligent networks; Multiprotocol label switching; Protection switching; Resource management; Routing; Spine; Telecommunication traffic; Virtual private networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Telecommunication Technologies, 2005. APSITT 2005 Proceedings. 6th Asia-Pacific Symposium on

Conference_Location

Yangon

Print_ISBN

4-88552-216-1

Type

conf

DOI

10.1109/APSITT.2005.203693

Filename

1593500