Abstract
Quality of Service (QoS) based routing provides QoS guarantees to multimedia applications and an efficient utilization of the network resources. Nevertheless, QoS routing is likely to be a costly process that does not scale when the number of nodes increases. Thus, the routing algorithm must be simple and a class-of-service routing is an alternative to provide QoS guarantees instead of per-flow routing. This paper proposes and analyzes the performance of a distance-vector QoS routing algorithm that takes into account three metrics: propagation delay, available bandwidth, and loss probability. Classes of service and metric-combination are used to turn the algorithm scalable and as complex as a two-metric one. The processing requirements of the proposed algorithm and those of an optimal approach are compared and the results show an improvement up to 50%.
Sponsors: UFRJ, CNPq, FAPERJ, CAPES, REENGE, and COFECUB.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick, RFC2386: A Framework for QoS-Based Routing. Network Working Group, Aug. 1998.
G. Apostolopoulos, R. Guerin, S. Kamat, and S. K. Tripathi, “Quality of service based routing: A performance perspective,” in ACM SIGCOMM’98, pp. 17–28, Sept. 1998.
N. Traft-Plotkin, B. Bellur, and R. Ogier, “Quality-of-Service routing using maximally disjoint paths,” in IEEE/IFIP IWQoS’99, June 1999.
D. H. Lorenz and A. Orda, “Qos routing in networks with uncertain parameters,” in IEEE INFOCOM’98, 1998.
V. Fayet, D. A. Khotimsky, and T. Przygienda, “Hop-by-hop routing with node-dependent topology information,” in IEEE INFOCOM’99, Mar. 1999.
A. Shaikh, J. Rexford, and K. G. Shin, “Evaluating the overheads of source-directed quality-of-service routing,” in International Conference on Network Protocols, 1998.
R. Braden, D. Clark, and S. Shenker, RFC1633: Integrated Services in the Internet Architecture: An Overview. Network Working Group, June 1994.
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, RFC2475: An Architecture for Differentiated Services. Network Working Group, Dec. 1998.
L. H. M. K. Costa and O. C. M. B. Duarte, “A scalable QoS-based routing mech anism for supporting multimedia applications,” in IEEE International Conference on Multimedia Computing and Systems-ICMCS’99, vol. 2, pp. 346–351, June 1999.
K. Fall and K. Varadhan, NS notes and documentation. University of California at Berkeley/Lawrence Berkeley National Laboratory, Mar. 1999. Available at http://www-mash.cs.berkeley.edu/ns.
C. Huitema, Routing in the Internet. Prentice Hall, 1996.
B. Davie and J. Gibson, “Enabling explicit routing in IP networks,” in IEEE GLOBECOM’98-Internet Mini-Conference, pp. 125–130, 1998.
G. Malkin, RFC1721: RIP Version 2 Protocol Analysis. Network Working Group, Nov. 1994.
J. Moy, RFC1583: OSPF version 2. Network Working Group, Mar. 1994.
R. Vogel, R. G. Herrtwich, W. Kalfa, H. Wittig, and L. C. Wolf, “QoS-based routing of multimedia streams in computer networks,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 7, pp. 1235–1244, Sept. 1996.
R. Guerin, A. Orda, and D. Williams, “QoS routing mechanisms and OSPF extensions,” in IEEE GLOBECOM’97, Nov. 1997.
Q. Ma and P. Steenkiste, “Quality of service routing for traffic with performance guarantees,” in IFIP Fifth International Workshop on Quality of Service, (New York), pp. 115–126, May 1997.
Z. Wang and J. Crowcroft, “Quality of service routing for supporting multimedia applications,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 7, pp. 1228–1234, Sept. 1996.
L. L. H. Andrew and A. A. N. A. Kusuma, “Generalised analysis of a QoS-aware routing algorithm,” in IEEE GLOBECOM’98, pp. 118–123, 1998.
W. C. Lee, M. G. Hluchyj, and P. A. Humblet, “Routing subject to quality of service constraints in integrated communication networks,” IEEE Network Magazine, vol. 9, no. 4, pp. 46–55, July–Aug. 1995.
H. F. Salama, D. S. Reeves, and Y. Viniotis, “A distributed algorithm for delay-constrained unicast routing,” in IEEE INFOCOM’97, 1997.
A. Fei, G. Pei, R. Liu, and L. Zhang, “Measurements on delay and hop-count of the Internet,” in IEEE GLOBECOM’98-Internet Mini-Conference, 1998.
J. J. Garcia-Luna-Aceves and J. Behrens, “Distributed, scalable routing based on link-state vectors,” IEEE Journal on Selected Areas in Communications, vol. 13, no. 8, pp. 1383–1395, Oct. 1995.
E. W. Zegura, K. Calvert, and S. Bhattacharjee, “How to model an internetwork,” in IEEE INFOCOM’96, vol. 2, pp. 594–602, Mar. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costa, L.H.M.K., Fdida, S., Duarte, O.C.M.B. (2000). Distance-Vector QoS-Based Routing with Three Metrics. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_71
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive