Prompt partial path optimization in MPLS networks

  • Orincsay D
  • Szviatovszki B
  • Böhm G
  • 3


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


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.

Author-supplied keywords

  • MPLS
  • Optimization
  • Routing
  • Traffic engineering

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Dániel Orincsay

  • Balázs Szviatovszki

  • Géza Böhm

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free