Loop-free routing using diffusing computations
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
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Loop-free constrained path computation for hop-by-hop QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed joint channel assignment, routing and scheduling for wireless mesh networks
Computer Communications
Delay coerced multi constrained quality of service routing algorithm
WSEAS Transactions on Information Science and Applications
Optimized multi constrained path quality of service routing protocol
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.00 |
Multi-constrained path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-constrained path optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an optimization metric, which makes path computation in MCPO even harder.We propose a fully distributed multi-constrained path optimization routing (MPOR) protocol that solves the general k-constrained path selection and routing optimization problems. MPOR computes paths using distance vectors exchanged only amongst neighboring nodes and does not require the maintenance of global network state about the topology or resources; supports hop-by-hop, connectionless routing of data packets, and implements constrained path optimization by distributively constructing an x-optimal path set (i.e., the shortest, the second shortest and up to the xth shortest path in terms of the optimization metric) for each destination at each node. Simulations show that MPOR has satisfactory routing success ratios for multi-constrained path selection, and performs consistently with varying number of constraints. For constrained path optimization, MPOR has high probabilities of finding feasible paths that are also optimal or near-optimal for the given optimization metric.