Constraint-based Routed Label Distribution Protocol (CR-LDP) is one of 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 LSP's that make a conflict (for example, the LSP's share a link).However CR-LDP coordinates such LSP's only. Therefore such coordinating (i.e. rerouting a LSP) would make some other conflicts (i.e. the rerouted LSP would share a link with other LSP's).This paper proposes a new traffic engineering method which is called "Multiagent-based Path Rerouting Method (MPRM)." When a conflict occurs, MPRM coordinates all LSP's 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 LSP's that make the conflict but also rerouting some LSP's that make no conflicts. This paper also evaluates basic performance of CR-LDP and MPRM.