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