Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Two additive-constrained path selection in the presence of inaccurate state information
Computer Communications
DeReQ: a QoS routing algorithm for multimedia communications in vehicular ad hoc networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Traffic driven multiple constraint-optimisation for QoS routing
International Journal of Internet Protocol Technology
Nonlinear search based pre-computation path selection algorithm
CSECS'08 Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing
Design and performance analysis of an inductive QoS routing algorithm
Computer Communications
Research challenges in QoS routing
Computer Communications
On provisioning in all-optical networks: an impairment-aware approach
IEEE/ACM Transactions on Networking (TON)
Unicast and multicast QoS routing with soft-constraint logic programming
ACM Transactions on Computational Logic (TOCL)
QoS routing using OLSR protocol
ICCOM'10 Proceedings of the 14th WSEAS international conference on Communications
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
A comparison of exact and ε-approximation algorithms for constrained routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Resource constrained shortest paths with a super additive objective function
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A genetic algorithm for finding a path subject to two constraints
Applied Soft Computing
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment
Journal of Intelligent and Robotic Systems
An ant system algorithm for the neutralization problem
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
| Hi-index | 0.00 |
Constraint-based path selection is an invaluable part of a full-fledged quality of service (QoS) architecture. Internet service providers want to be able to select paths for QoS flows that optimize network utilization and satisfy user requirements and as such increase revenues. Unfortunately, finding a path subject to multiple constraints is known to be an NP-complete problem. Hence, accurate constraint-based path selection algorithms with a fast running time are scarce. Numerous heuristics and a few exact algorithms have been proposed. In this article we compare most of these algorithms. We focus on the restricted shortest path algorithms and multi-constrained path algorithms. The performance evaluation of these two classes of algorithms is presented based on complexity analysis and simulation results and may shed some light on the difficult task of selecting the proper algorithm for a QoS-capable network.