On-demand optimization of label switched paths in MPLS networks

Multiprotocol label switching (MPLS) technology provides efficient means for controlling the traffic of IP backbone networks and thus, offers performance superior to that of traditional interior gateway protocol (IGP)-based packet forwarding. However, computation of explicit paths yielding optimal network performance is a difficult task; several different strategies can be thought of. We propose a novel approach for the optimal routing of new label switched paths (LSP). Our method is based on the idea that we allow the re-routing of an already established LSP when there is no other way to route the new one. Our optimization algorithm is based on an integer linear programming (ILP) formulation of the problem. We show by numerical evaluation that our method significantly improves the success probability of setting up new LSP by extending the widely known constrained shortest path first (CSPF) algorithm with the ILP-based re-routing function. Although the task itself is NP-hard, our heuristic method provides efficient solution in practical cases. The proposed algorithm is aimed to be implemented primarily in a network operation center. However, with the restriction that only LSP starting from the optimizing label edge routers can be re-routed, the algorithm can be implemented directly in edge routers themselves in a distributed fashion