Introduction to algorithms
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
On the complexity of quality of service routing
Information Processing Letters
An efficient algorithm for finding a path subject to two additive constraints
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Search Space Reduction in QoS Routing
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
A link weight assignment algorithm for traffic-engineered networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A minimum interference routing algorithm with reduced computational complexity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast and efficient routing algorithms for delay-bounded and dependable channels
Computer Communications
DeSiNe: a flow-level QoS simulator of networks
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Rerouting in advance for preempted IR calls in QoS-enabled networks
Computer Communications
Research challenges in QoS routing
Computer Communications
A dynamic approach to reduce preemption in book-ahead reservation in QoS-enabled networks
Computer Communications
Supporting differentiated QoS in MPLS networks
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We consider the problem of computing traffic engineered paths for requests having bandwidth and delay requirements, when these requests arrive in the network independent of one another. Providing bandwidth guarantees to applications has been important in networks offering service differentiation. With the increase in the number of real-time applications in the Internet, provision of delay guarantees is also receiving much attention. This necessitates the development of sophisticated path selection algorithms which deviate from the shortest-path routing philosophy in traditional IP networks. While these algorithms perform well from the perspective of satisfying application requirements, they often do not take into account long term effects on the network state. One of the major concerns of a service provider is to run the network at maximum utilization while reducing network costs and preventing congestion in the network. For this reason, providers are looking at traffic engineering (TE) to automate path selection procedures and to maintain network loading at an optimal level. In this paper we propose two TE path selection algorithms that consider the application's delay-bandwidth requirements as well as the TE constraints on the network. We compare the proposed algorithms to existing path computation solutions and present results that show that by considering these additional constraints, improvement is achieved in terms of reduction in request blocking probability, reduction in network costs and load distribution.