Prompt partial path optimization in MPLS networks

Citations of this article
Mendeley users who have this article in their library.
Get full text


In this paper we evaluate approaches that allow the re-routing of a set of already established label switched paths (LSPs) in multiprotocol label switching (MPLS) networks when a new LSP demand faces constrained shortest path first failure. Two optimization algorithms are proposed: one is based on an integer linear programming formulation of the problem, while the other one is a heuristic method based on Dijkstra's shortest path first algorithm. We analyze the efficiency of our algorithms in a dynamic network environment. The simulation experiments show that our method significantly increases the total network throughput. We also investigate the limitations of the applicability of proposed methods considering their running time. © 2003 Elsevier B.V. All rights reserved.




Orincsay, D., Szviatovszki, B., & Böhm, G. (2003). Prompt partial path optimization in MPLS networks. Computer Networks, 43(5), 557–572.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free