Abstract
Multimedia applications are Quality of Service (QoS) sensitive, which makes QoS support indispensable in high speed Integrated Services Packet Networks (ISPN). An important aspect is QoS routing, namely, the provision of QoS routes at session set up time based on user request and information about available network resources. This paper develops optimal QoS routing algorithms within an Autonomous System (AS). Previous approaches have been based either on minimizing a single metric (delay, for instance) or a combination of multiple metrics, optimizing one at a time, in a hierarchical fashion. Our approach finds minimum hop paths which satisfy multiple QoS constraints. We argue that a QoS version of the Bellman-Ford routing algorithm provides the best strategy for QoS routing problems of a given type. We show that Bellman-Ford is very powerful in solving most multiple constrained routing problems arising in a flat network (within an autonomous system), if the minimum hop is the main objective function. We further illustrate the importance of Bellman-Ford QoS routing algorithms with regard to network utilization and session blocking through simulation experiments.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35388-3_42
Chapter PDF
Similar content being viewed by others
References
D. Bertsekas and R. Gallager (1992) Data Networks, Prentice-Hall.
Cormen, Leiserson and Rivest (1990) Introduction to Algorithms, McGraw-Hill.
M. R. Garey and D. S. Johnson (1979) Computers and Intractability, Freeman, San Francisco.
L. Georgiadis, R. Guerin, V. Peris (1996) Efficient Network QoS Provisioning Based on per Node Traffic Shaping, In Proceedings of IEEE INFOCOM96, vol. 1, pp. 102–110.
R. Guerin, A. Orda, and D. Williams (1997a) QoS Routing Mechanisms and OSPF Extensions, In Proceedings of IEEE GLOBECOM97, Vol. 3, pp. 1903–1908, Phoenix, Arizona.
R. Guerin, S. Kamat, and S. Herzog (1997b) QoS Path Management with RSVP, In Proceedings of IEEE GLOBECOM97, Vol. 3, pp. 1914–1918, Phoenix, Arizona.
M. Henig (1994) Efficient Interactive Method for a Class of Multiattribute Shortest Path Problems, In Proceedings of Management Science, Vol. 40, 7, pp. 891–897.
K. Lee, K. Kim, H. Choi, K. Kim, and S. Kim (1997) QoS Based Routing for Integrated Multimedia Services, In Proceedings of GLOBECOM97, Vol.2, pp. 1047–1051, Phoenix, Arizona.
C. Pornavalai, G. Chakraborty, and N. Shiratori (1997) QoS Based Routing Algorithm in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 167–175.
Z. Wang and J. Crowcroft (1995) Bandwidth-Delay Based Routing Algorithms, In Proceedings of GLOBECOM95, Vol. 3, pp. 2129–2133.
H. Zhang (1995) Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks, In Proceedings of the IEEE, 83 (10), pp. 1374–1396.
W. Zhao and S. K. Tripathi (1997) Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 175–182.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Cavendish, D., Gerla, M. (1998). Internet QoS Routing using the Bellman-Ford Algorithm. In: van As, H.R. (eds) High Performance Networking. HPN 1998. IFIP — The International Federation for Information Processing, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35388-3_37
Download citation
DOI: https://doi.org/10.1007/978-0-387-35388-3_37
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5397-4
Online ISBN: 978-0-387-35388-3
eBook Packages: Springer Book Archive