Data networks
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
A distributed algorithm for delay-constrained unicast routing
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)
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Search space reduction in QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Delay-Constrained Least-Cost Path Routing Protocol and the Synthesis Method
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
On Finding Multi-Constrainted Paths
On Finding Multi-Constrainted Paths
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
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
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
A distributed approach for multi-constrained path selection and routing optimization
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
On the impact of quality of protection in wireless local area networks with IP mobility
Mobile Networks and Applications
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Pervasive QoS routing in next generation networks
Computer Communications
A trustworthiness-based QoS routing protocol for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
It is well known that the Delay-Constrained Least-Cost (DCLC) unicast routing problem is NP-complete, hence various heuristic algorithms have been developed for this problem. In this paper, we propose a more efficient distributed algorithm, namely, Selection-Function-based DCLC (SF-DCLC), based on a novel selection function for the DCLC problem. The proposed SF-DCLC algorithm requires limited network state information at each node and is always able to find a loop-free path satisfying the delay bound if such paths exist. Simulation study shows that SF-DCLC is not as sensitive to the delay bound and the size of networks as some other DCLC routing algorithms, and has very low cost-inefficiency compared to the optimal one in various network scenarios we have studied. A noteworthy feature of SFDCLC is that SF-DCLC has very high probability of finding the optimal solution in polynomial time with low computational complexity and message complexity.