Improved agent based explicit path computation algorithm for MPLS-TE

A well-known traffic engineering technology in MPLS network is the constraint-based routed label distribution protocol (CR-LDP). In case of conflict, CR-LDP coordinates LSPs that causes conflict, which would result in other conflicts and may cause chain of rerouting. Multi agent based path rerouting method avoids this chain of rerouting. In case of conflict MPRM co-ordinates all LSPs not only the conflicting LSP. We propose an algorithm which finds out the most optimized path without having any conflict. Our algorithm will also find out the most efficient alternate path through which the traffic can reroute in case of failure of link.