Introduction to algorithms
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
QoS routing in networks with uncertain parameters
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
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
QoS based routing algorithm in integrated services packet networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
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)
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Routing multimedia traffic with QoS guarantees
IEEE Transactions on Multimedia
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
A tree-based particle swarm optimization for multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research
An efficient Dynamic Addressing based routing protocol for Underwater Wireless Sensor Networks
Computer Communications
| Hi-index | 0.24 |
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (LHMACP) selection, which is NP-complete. Then, we propose the k-shortest paths Extended Bellman-Ford (k-EB) algorithm, which is capable of computing All Hops k-shortest Paths (AHKP) between a source and a destination. Through extensive analysis and simulations, we show that the heuristic algorithm, based on k-EB, is highly effective in finding a least hop path subject to multiple additive constraints with very low computational complexity; it achieves near 100% success ratio in finding a feasible path while minimizing its average hop count.