Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering

This paper presents a fast and non-greedy interference minimizing routing algorithm (IMRA) for dynamic routing of bandwidth guaranteed LSPs (label switched paths). The algorithm operates on-line by handling requests that arrive one by one without the need for a priori knowledge of traffic characteristics except the information on the ingress-egress pairs. Our proposed algorithm combines three criteria: minimization of interference, saving of residual link bandwidth, and optimal usage of network capacity. The most important feature is the fast path computation to achieve short response time, which is a crucial factor for on-line routing algorithms. IMRA's complexity is low, consequently scalable for large networks and suitable for on-line routing. Experiments under dynamic (short-lived) LSP requests show better performance than existing non-greedy routing algorithms, while consuming lower computation effort.

[1]  Bin Wang,et al.  A new bandwidth guaranteed routing algorithm for MPLS traffic engineering , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[2]  Gerald Franzl,et al.  A New Bandwidth Guaranteed Routing Approach for Online Calculation of LSPs for MPLS Traffic Engineering , 2003, MMNS.

[3]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[4]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[6]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[7]  Subhash Suri,et al.  Profile-Based Routing: A New Framework for MPLS Traffic Engineering , 2001, QofIS.

[8]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[9]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[10]  Didier Colle,et al.  Pan-European Optical Transport Networks: An Availability-based Comparison , 2004, Photonic Network Communications.

[11]  Li Li,et al.  Traffic engineering standards in IP-networks using MPLS , 1999, IEEE Commun. Mag..

[12]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[13]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[14]  Gerald Franzl,et al.  Residual network and link capacity weighting for efficient traffic engineering in MPLS networks , 2003 .

[15]  Bin Wang,et al.  A Bandwidth Guaranteed Integrated Routing Algorithm in IP over WDM Optical Networks , 2003, Photonic Network Communications.

[16]  Anees Shaikh,et al.  Evaluating the overheads of source-directed quality-of-service routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[17]  Subhash Suri,et al.  Profile-based routing and traffic engineering , 2003, Comput. Commun..