Data networks
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
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Adaptive proportional routing: a localized QoS routing approach
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
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
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
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
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
A multi-constrained quality of service routing algorithm based on vector converting
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Optimized multi constrained path quality of service routing protocol
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.00 |
We present the distributed multi-constrained routing (DMR) protocol for the computation of constrained paths for QoS routing in computer networks. DMR exploits distance vectors to construct a logical shortest multipath (LSM) for each destination with regard to a given optimization metric, from which a set of non-dominated paths are locally derived at each node. As such DMR is able to find feasible paths as well as optimize the utilization of routing resources. DMR operates in line with the hop-by-hop, connectionless routing model assumed in the IP Internet, and maintains instantaneous loop freedom. Nodes running DMR need not maintain a global view of network state (topology and resource information), and routing updates are sent only to neighboring nodes. This is in sharp contrast with all previous approaches that rely on complete or partial network state for constrained path computation, which incurs excessive communication overhead in large networks and is hard to achieve in practice.