Multiagent-based path rerouting method in MPLS networks

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.