Q-BATE: a QoS constraint-based traffic engineering routing algorithm

The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements, they often do not consider the perspective of service providers. Service providers aim at optimizing resource usage and maximizing the throughput and the number of accepted requests. These goals have been addressed by traffic engineering algorithms, which usually consider bandwidth as the sole application requirement. We propose a new routing algorithm, Q-BATE, which attempts to optimize network utilization while still offering QoS guarantees. The basic concepts of Q-BATE are look-ahead, depth-first approach and a path length definition as a function of both the available bandwidth and other additive QoS measures. This paper presents a comparative analysis of several proposed algorithms via simulation studies. The simulations show that Q-BATE perform better than the other algorithms and it has a fast running time

[1]  Deepinder P. Sidhu,et al.  Comparative analysis of path computation techniques for MPLS traffic engineering , 2002, Comput. Networks.

[2]  Stefano Avallone,et al.  Dynamic Routing in QoS-Traffic Engineered Networks , 2006 .

[3]  Daniel Bauer,et al.  A New Class of Online Minimum-Interference Routing Algorithms , 2002, NETWORKING.

[4]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[5]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS requirements , 2001, Comput. Networks.

[6]  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).

[7]  Piet Van Mieghem,et al.  TAMCRA: a tunable accuracy multiple constraints routing algorithm , 2000, Comput. Commun..

[8]  Piet Van Mieghem,et al.  Dynamic Routing in QoS-Aware Traffic Engineered Networks , 2005, EUNICE.

[9]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[10]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

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

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[13]  Nelson Luis Saldanha da Fonseca,et al.  A minimum interference routing algorithm , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[14]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[15]  Tibor Cinkler,et al.  A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).