Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Distributed, scalable routing based on vectors of link states
IEEE Journal on Selected Areas in Communications
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
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
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Developing scalable protocols for three-metric QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Search space reduction in QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms for the Multi-constrained Routing Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Multiconstraint QoS Routing Using a Path-Vector Protocol
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
Distance-Vector QoS-Based Routing with Three Metrics
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A scalable multicast protocol with QoS guaranties
Network control and engineering for Qos, security and mobility II
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
A new distributed QoS routing algorithm based on Fano's method
Computer Networks and ISDN Systems
Computers and Operations Research
Hierarchical analysis of process variation for mixed-signal systems
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Cybernetics and Systems Analysis
Precomputation for intra-domain QoS routing
Computer Networks and ISDN Systems
Novel schemes for traffic engineering in access domains
International Journal of Network Management
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
Research challenges in QoS routing
Computer Communications
A case for tree evolution in QoS multicasting
Computer Communications
A new distributed QoS routing algorithm based on Fano's method
Computer Networks: The International Journal of Computer and Telecommunications Networking
Precomputation for intra-domain QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Operations Research
International Journal of Metaheuristics
Jitter-minimized reliability-maximized management of networks
International Journal of Network Management
Stability routing with constrained path length for improved routability in dynamic MANETs
Personal and Ubiquitous Computing
Research: A new distributed routing algorithm for supporting delay-sensitive applications
Computer Communications
Preferred link based delay-constrained least-cost routing in wide area networks
Computer Communications
Algorithms for delay-constrained low-cost multicast tree construction
Computer Communications
| Hi-index | 0.00 |
In this paper, we study the NP-hard delay-constrained least-cost path problem, and propose a simple, distributed heuristic solution: the delay-constrained unicast routing (DCUR) algorithm. DCUR requires limited network state information to be kept at each node: a cost vector and a delay vector. We prove DCUR's correctness by showing that it is always capable of constructing a loop-free delay-constrained path within finite time, if such a path exists. The worst case message complexity of DCUR is O(|V|^3) messages, where |V| is the number of nodes. However, simulation results show that, on the average, DCUR requires much fewer messages. Therefore, DCUR scales well to large networks. We also use simulation to compare DCUR to the optimal algorithm, and to the least-delay path algorithm. Our results show that DCUR's path costs are within 10% from those of the optimal solution.