Improved MPLS-TE LSP Path Computation using Preemption

Imène Chaieb (1) , Jean-Louis Le Roux (1) , Bernard Cousin (2, 3)

1 Orange Labs [Lannion]
2 ATNET - Advanced Technolgy in Networking
3 UR - Université de Rennes

In Multi-Protocol Label Switching-Traffic Engineering (MPLS-TE) networks with distributed tunnel path computation on head-end routers, tunnel requests are handled one by one, in an uncoordinated manner without any knowledge of future and other requests. The order in which requests are handled has a significant impact on the network optimization and blocking probability. If it is not possible to control the arrival order, in return it is possible, in some cases, to reorder requests using the preemption function. This paper evaluates the impact of the arrival order, so as to determine efficient orders. It then proposes two preemption strategies so as to reorder arrivals and evaluate these strategies applied to the shortest constrained path computation algorithm.

Mots clés: MPLS Networks; Path Computation; Packet scheduling with preemption

Domaines: Réseaux et télécommunications [cs.NI]

Imène Chaieb, Jean-Louis Le Roux, Bernard Cousin. Improved MPLS-TE LSP Path Computation using Preemption. IEEE Global Information Infrastructure Symposium (GIIS 2007), Jul 2007, Marrakech, Morocco. pp.218 - 221, ⟨10.1109/GIIS.2007.4404195⟩. ⟨hal-01184229⟩