Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
A randomized algorithm for finding a path subject to multiple QoS requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
Search Space Reduction in QoS Routing
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Routing with topology aggregation in delay-bandwidth sensitive networks
IEEE/ACM Transactions on Networking (TON)
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
Routing multimedia traffic with QoS guarantees
IEEE Transactions on Multimedia
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Optimal partition of QoS requirements with discrete cost functions
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Performance evaluation of constraint-based path selection algorithms
IEEE Network: The Magazine of Global Internetworking
Nonlinear search based pre-computation path selection algorithm
CSECS'08 Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing
| Hi-index | 0.00 |
Multi-constrained path (MCP) selection is one of the great challenges that QoS routing (QoSR) faces. To address it in an efficient and highly responsive manner, we propose a new QoSR algorithm, namely NM_MCP (normal measure-based multiple constrained path). Using the Dijkstra's algorithm with respect to each link metric, NM_MCP pre-computes k primary paths in advance, where k is the number of link weights. When a routing request arrives, NM_MCP executes a modified version of the Dijkstra's algorithm using a newly proposed, normal-measure-based nonlinear cost function. Extensive simulations show that NM_MCP achieves higher success rate in finding feasible paths with less computational cost than existing algorithms. To further improve the performance, we incorporate Pareto and nonlinear look-ahead mechanisms into the algorithm.