[en] In the context of Multiprotocol Label Switching (MPLS), we propose an integration of a computationally efficient preemption mechanism into a very dynamic Label Switched Paths (LSPs) routing scheme described in a previous paper. This preemption scheme includes a quick heuristic able to select the most interesting LSPs to reroute from a link. 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. This integrated traffic engineering entity is tested on the accuracy of the heuristic, the relevance of the feedback and the whole integration, the influence of the routing policy on the preemption mechanism and the reliability of the managed network.
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 :
Routing in a MPLS network featuring preemption mechanisms
Publication date :
February 2003
Event name :
IEEE ICT 2003
Event place :
Papeete, French Polynesia
Event date :
23-28 Feb. 2003
Audience :
International
Main work title :
10th IEEE International Conference on Telecommunications
D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow. RSVP-TE: Extensions to RSVP for LSP tunnels:. RFC 3209, Dec 2001.
B. Jamoussi, Editor, L. Andersson, R. Callon, R. Dantu, L. Wu, P. Doolan, T. Worster, N. Feldman, A. Fredette, M. Girish, E. Gray, J. Heinanen, T. Kilty, and A. Malis. Constraint-based LSP setup using LDP. RFC 3212, Jan 2002.
Murali S. Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In INFOCOM (2), pages 884-893, 2000.
P. Aukia, M. Kodialam, P. Koppol, T. Lakshman, H. Sarin, and B. Suter. RATES: A server for MPLS traffic engineering. RATES: A server for MPLS traffic engineering, IEEE Network Magazine, pp. 34-41, March/April 2000.
S. Salsano, F. Ricciato, M. Listanti, and A Belmonte. Offline configuration of a MPLS over WDM network under time-varying offered traffic. INFOCOM, June 2002.
Mohammad Peyravian and Ajay D. Kshemkalyani. Connection preemption: Issues, algorithms, and a simulation study. IEEE Infocom, April 1997.
J.C. de Oliveira, C. Scoglio, I.F. Akyildiz, and G. Uhl. A new preemption policy for diffserv-aware traffic engineering to minimize rerouting. IEEE Infocom, June 2002.
F. Blanchy, L. Mélon, and G. Leduc. An efficient decentralized on-line traffic engineering algorithm for MPLS networks. Available at http://run.montefiore.ulg.ac.be/∼blanchy, July 2002.
R. Bellman and R. Kalaba. Shortest paths through networks. Dynamic Programming and Modern Control Theory, pp. 50-54, Academic Press, 1965.
B. Szviatovszki, A. Szentesi, and A. Juttner. Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing. Computer Communications 25 (1076-1083), 2002.
E. Rosen et al. Multiprotocol label switching architecture. RFC 3031, Jan 2001.
F. Le Faucheur and W. Lai. Requirements for support of diff-serv-aware MPLS traffic engineering. IETF Draft draft-ietf-tewg-diff-te-reqts-06.txt, September 2002.
