Multiconstraint QoS Routing Using a Path-Vector Protocol

Authors:
Kitt Tientanopajai;Kanchana Kanchanasut
Affiliations:
-;-
Venue:
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
Year:
2002

Citing 5
Cited 0

Distance-Vector QoS-Based Routing with Three Metrics

NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A Distributed Algorithm for Delay-Constrained Unicast Routing

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Scalable QoS-Based Routing Mechanism for Supporting Multimedia Applications

ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Internet QoS: a big picture

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a path-vector protocol for multiconstraint QoS routing. The protocol allows nodes in the network to exchange paths, and constructs new paths using our distributed algorithm. Explicit paths provided by the protocol could be used for both multiconstraint QoS and best-effort services. To deal with scalability, we introduce an algorithm to reduce the number of paths by using a clustering method. The method searches and removes paths based on similarity of measurements of path metrics. Simulation results show that our path-vector protocol is scalable and capable to provide explicit paths for multiconstraint QoS routing. Success rate of QoS path setup in simulated heterogeneous networks could be as high as 92 percents.