Abstract
The constraint-based routed label distribution protocol (CR-LDP) is a well-known traffic engineering technologies in MPLS networks. CR-LDP is a signaling protocol for establishing a label switching path (LSP) and has a function such that CR-LDP coordinates LSPs that conflict (for example, the LSPs share a link). However CR-LDP coordinates such LSPs only. Therefore such coordination (i.e. rerouting a LSP) would result in other conflicts (i.e. the rerouted LSP would share a link with other LSPs). This paper proposes a new traffic engineering method which is called the multiagent-based path rerouting method (MPRM). When a conflict occurs, MPRM coordinates all LSPs without concerning the conflict in order to avoid new conflicts caused by dissolving the conflict. For avoidance of new conflicts, MPRM performs not only rerouting of LSPs that make the conflict but also rerouting some LSPs that result in no conflicts. This paper also evaluates basic performance of CR-LDP and MPRM.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
