Multiconstraint QoS Routing Using a Path-Vector Protocol

  • Kitt Tientanopajai
  • Kanchana Kanchanasut
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2550)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. H. Costa, S. Fdida, and O. C. Duarte, “Distance-vector QoS-based Routing with Three Metrics” in IFIP Networking’2000/HPN. (2000) 847–858.Google Scholar
  2. 2.
    G. Apostolopoulos, D. William, S. Kamat, R. Guerin, A. Orda, and T. Przygienda, RFC 2676-QoS Routing Mechanisms and OSPF Extension, IBM, Lucent, Upenn, Technion, and Siara System (1999)Google Scholar
  3. 3.
    Z. Wang, and J. Crowcroft, “Quality-of-Service Routing for Supporting Multimedia Applications” in IEEE Journal on Selected Areas in Communications, Vol. 14,No. 7. (1996)Google Scholar
  4. 4.
    J. Moy, RFC 2328-OSPF version 2, Ascend Communications. (1998)Google Scholar
  5. 5.
    C. Partridge, RFC 1363-A Proposed Flow Specification, BBN. (1992)Google Scholar
  6. 6.
    S. Shenker, C. Partridge, and R. Guerin, RFC 2212-Specification of Guaranteed Quality of Service, Xerox, BBN, and IBM. (1997)Google Scholar
  7. 7.
    X. Xiao, and L. M. Ni, “Internet QoS: A Big Picture” in IEEE Network. (1999)Google Scholar
  8. 8.
    M. R. Anderberg, Cluster analysis for applications. Academic Press. (1973)Google Scholar
  9. 9.
    G. Milligan, and P. Isaac, “The Validation of Four Ultrametric Clustering Algorithms” in Pattern Recognition, vol. 12. (1980) 41–50.CrossRefGoogle Scholar
  10. 10.
    L. H. Costa, and O. C. Duarte, “A Scalable QoS-based routing mechanism for supporting multimedia applications” in IEEE International Conference on Multimedia Computing and Systems, vol. 2. (1999) 346–351.Google Scholar
  11. 11.
    R. Widyono “The design and evalulation of routing algorithms for real-time channels” in Technical Report TR-94-024, UC Berkeley. (1994)Google Scholar
  12. 12.
    H. F. Salama, D. S. Reeves, and Y. Viniotis, “A distributed algorithm for delayconstrained unicast routing” in Proc. of IEEE INFOCOM’97. (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Kitt Tientanopajai
    • 1
  • Kanchana Kanchanasut
    • 1
  1. 1.Division of Computer Science and Information ManagementAsian Institute of TechnologyPathumthaniThailand

Personalised recommendations