Traffic engineering involves adapting the routing of traffic to the
network conditions, with the joint goals of good user perfo
Traffic engineering involves adapting the routing of traffic
to the network conditions, with the joint goals of good user performance and
efficient use of network resources. It can be split into intra-domain and
inter-domain, achieved with traditional IP routing protocols or by relying on
MPLS (MultiProtocol Label Switching). Traffic engineering research topics
include link weights adaptation, QoS or constraint-based routing and
protection/restoration by resource sharing. Generally, these problems are
NP-complete. This means that simple heuristics that produce good solutions in
reasonable time must be found for on-line computation. Off-line computation can
employ more sophisticated heuristics.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford,
"NetScope: Traffic engineering for IP Networks", IEEE Network
K. Kar, M. Kodialam, T.V. Lakshman, "Minimum
Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic
Engineering Applications", IEEE Journal on Selected Areas in
Communications, December 2000.
A. Elwalid, C. Jin, S. Low, I. Widjaja, "MATE: MPLS
Adaptive Traffic Engineering", Proc. of IEEE INFOCOM, April 2001.
M. Kodialam and T.V. Lakshman, "Dynamic Routing
of Locally Restorable Bandwidth Guaranteed Tunnels using Aggregated Link Usage
Information", Proc. of IEEE INFOCOM 2001.
B. Fortz and M. Thorup, "Traffic engineering with
traditional IP routing protocols," IEEE Communications Magazine, 40(10),
G. Li, D. Wang, C. Kalmanek and R. Doverspike,
"Efficient Distributed Path Selection for Shared Restoration
Connections", Proc. of IEEE INFOCOM 2002.
J.C. de Oliveira, C. Scoglio, I.F. Akyildiz, and G.
Ulh. "A new preemption policy for diffserv-aware traffic engineering to
minimize rerouting". IEEE Infocom, June 2002.
G. Banerjee and D. Sidhu, "Comparative analysis
of path computation techniques for MPLS traffic engineering". In Computer
Networks 40, 2002, pp. 149-165.
B. Szviatovszky, A. Szentesi, and A. Juttner.
"Minimizing re-routing in MPLS networks with preemption-aware
constraint-based routing". Computer Communications 25 (1076-1083), 2002.
Research performed in RUN
F. Blanchy and L. Mélon
have proposed three generic algorithms for on-line decentralized intra-domain traffic
engineering in a MPLS network. The first one is an efficient algorithm for
routing LSPs (Label Switched Paths) under constraints while nearly optimizing
score functions like load balancing, network utilization or combinations
thereof. The second algorithm takes account of preemption levels among LSPs
with the double objective of (1) routing LSPs without inducing too many
reroutings of lower priority ones, and (2), when necessary, choosing the most
appropriate LSPs to reroute. The third algorithm calculates the paths of local
backup LSPs for fast rerouting in case of node or link failure. It keeps the
resources consumed by the backups to a minimum by an efficient aggregation of
resources among LSPs. Those algorithms have all been assessed by simulations.
G. Leduc, H. Abrahamsson, S. Balon, S. Bessler, M. D'Arienzo, O. Delcourt, J. Domingo-Pascual, S. Cerav-Erbas, I. Gojmerac, X. Masip, A. Pescapè, B. Quoitin, S. P. Romano, E. Salvadori, F. Skivée, H. T. Tran, S. Uhlig and H. Ümit
Computer Communications, vol. 29, nb. 5, March 2006, pp. 593-610
Actes de Colloque Francophone sur l'Ingénierie des Protocoles (CFIP), 29 Mar.-1 Avr. 2005, Bordeaux, France, Richard Castanet (ed.), Ingénierie des protocoles - Qualité de service, multimédia et mobilité, pp. 317-332, Hermès Lavoisier
(Acceptance ratio = 33/108 = 30.6%)
A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks
Proc. of 11th IEEE International Conference on Telecommunications (ICT'2004), 1-6 Aug. 2004, Fortaleza, Brazil, J. Neuman de Souza, P. Dini, P. Lorenz (eds.), Telecommunications and Networking, LNCS, 3124, pp. 644-653, Springer Verlag
(ISI IF 2004 LNCS = 0.513)
A Preemption-Aware On-line Routing Algorithm for MPLS Networks
Actes de Colloque Francophone sur l'Ingénierie des Protocoles (CFIP'2002), 27-30 May 2002, Montréal, Canada, A. Obaid (ed.), Ingénierie des protocoles - Réseaux mobiles et ad hoc, qualité de service, multimédia, ingénierie du trafic, pp. 503-517, Hermès Lavoisier 2002