[en] Multi-Protocol Label Switching (MPLS) provides ways to control the Label Switched Paths (LSPs) followed by traffic trunks in a network and thereby to better traffic engineer it. In this context, we look at the problem of organizing the mapping of 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. It is then applied to a seldom mentioned traffic engineering problem: the compromise between load-balancing and traffic minimization. It is expected that clever routing strategies to balance the network load will sometimes favor longer paths in order to avoid congestion, leading to an increase of the overall network utilization. This reasoning is confirmed by our study, and we show that an improvement in network management can be made by appropriately tuning this compromise.
Disciplines :
Computer science
Author, co-author :
Blanchy, François; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
Mélon, Laurent; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
Leduc, Guy ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
Language :
English
Title :
An efficient decentralized on-line traffic engineering algorithm for MPLS networks
Publication date :
August 2003
Event name :
18th International Teletraffic Congress (ITC18)
Event place :
Berlin, Germany
Event date :
31 Aug. - 5 Sep. 2003
Audience :
International
Main work title :
Providing Quality of Service in Heterogeneous Environments