Telecommunication Systems

, Volume 24, Issue 2, pp 187–206

A Preemption-Aware On-line Routing Algorithm for MPLS Networks

  • François Blanchy
  • Laurent Mélon
  • Guy Leduc
Article

DOI: 10.1023/A:1026166813657

Cite this article as:
Blanchy, F., Mélon, L. & Leduc, G. Telecommunication Systems (2003) 24: 187. doi:10.1023/A:1026166813657

Abstract

In the context of Multiprotocol Label Switching (MPLS), we look at the problem of organizing the mapping of Label Switched Paths (LSPs) in an optimal way throughout the network on the basis of a given objective function. This problem is highly combinatorial and makes dynamic and real-time features a difficult issue for any LSP routing scheme. For this reason, we propose a computationally efficient, though approximate, on-line scheme adapted to an incremental optimization of the network state. We also propose an integration of a computationally efficient preemption mechanism into this approximation. The efficiency of this algorithm is obtained through a very rigid but seemingly appropriate policy concerning which LSPs are appropriate for preemption. A feedback from preemption on the routing process is proposed, in order to regulate the rate of the reroutings and to tune the balance between stability and continuous reorganization in a network.

MPLS traffic engineering preemption 

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • François Blanchy
    • 1
  • Laurent Mélon
    • 1
  • Guy Leduc
    • 1
  1. 1.Research Unit in Networking, EECS Department, Montefiore InstituteUniversity of LiègeBelgium

Personalised recommendations