Should QoS routing algorithms prefer shortest paths?
Kowalik, Karol and Collier, Martin (2003) Should QoS routing algorithms prefer shortest paths? In: ICC 2003 - IEEE International Conference on Communications, 11-15 May 2003, Anchorage, Alaska, USA. ISBN 0-7803-7802-4
Full text available as:
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. The problem of selecting such constrained paths is the task of quality of service (QoS) routing. This paper considers link-state routing, and the choice of cost metric used to implement QoS routing. There are two schools of thought regarding the choice of link cost. It is commonly assumed that QoS routing algorithms should limit hop count so as to conserve resources for future connections. Others advocate load balancing mechanisms so as to increase overall network utilisation. This paper investigates which of these approaches gives the better performance. We show that there is no one general answer to this question. We also point out the dangers of drawing general conclusions about routing algorithm performance based on the study of only a limited set of network topologies.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||internet; quality of service; telecommunication network routing; telecommunication traffic;|
|Subjects:||Engineering > Telecommunication|
|DCU Faculties and Centres:||Research Initiatives and Centres > Research Institute for Networks and Communications Engineering (RINCE)|
|Published in:||IEEE International Conference on Communications, 2003. . Institute of Electrical and Electronics Engineers. ISBN 0-7803-7802-4|
|Publisher:||Institute of Electrical and Electronics Engineers|
|Copyright Information:||©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Deposited On:||19 Jul 2010 13:53 by DORAS Administrator. Last Modified 19 Jul 2010 13:53|
Archive Staff Only: edit this record