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
Introduction to Algorithms
Adaptive proportional routing: a localized QoS routing approach
IEEE/ACM Transactions on Networking (TON)
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Optimal and heuristic algorithms for quality-of-service routing with multiple constraints
Performance Evaluation
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Scalable One Chip Design for a Multiplex Tap with Timestamping
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
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
Loop-free constrained path computation for hop-by-hop QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality-of-Service routing with path information aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding multi-constrained feasible paths by using depth-first search
Wireless Networks
QuESt: a QoS-based energy efficient sensor routing protocol
Wireless Communications & Mobile Computing - Distributed Systems of Sensors and Actuators
On the Distributed Bellman-Ford Algorithm and the Looping Problem
INFORMS Journal on Computing
Energy efficient and QoS based routing protocol for wireless sensor networks
Journal of Parallel and Distributed Computing
Statistical Convergence Analysis of Routing Algorithms
ICN '10 Proceedings of the 2010 Ninth International Conference on Networks
Multi-objective and multi-constrained non-additive shortest path problems
Computers and Operations Research
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
One of the key issues in providing Quality-of-Service (QoS) guarantees in packet networks is how to determine a feasible path that satisfies a set of additive constraint. Finding a path subject to multiple additive constraints is intractable. In this paper a distributed Optimized Multi Constrained Routing (OMCR) protocol is proposed that computes feasible paths at each node and routes the packets based on their destinations address. OMCR performs connectionless, hop-by-hop Internet Protocol routing and need not remember the global state of the network. It makes routing decision independently and therefore has the ability to respond to network dynamics swiftly. The volume of update messages are reduced significantly by using vector transform method and formation of loops reduced by addressing count-to-infinity issues effectively. OMCR protocol outperforms shortest path routing protocols both link-state and distance vector in terms of convergence time, success ratio and message overhead.