By Topic

Performance analysis of QoS routing with network dependant delay cost

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Hahnearl Jeon ; Dept. of Electron. Eng., Yonsei Univ., Seoul, South Korea ; Sung-Dae Kim ; Young-Joon Kim ; Hyung-Taek Kim
more authors

This paper investigates the problem of path calculation of multiple metric routing. Today's Internet routing is based on a single metric path selecting algorithm. The single metric path is a best effort service that can only support a path for one requirement. In order to support quality-of-service (QoS) call, the path is subject to multiple constraints on the routing metric. In many cases, the path finding problem is NP-complete. This paper proposes the widest-least cost routing algorithm that uses a cost metric that is based on a delay metric and influenced by the resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has the traffic distribution ability to serve a traffic engine ring. Our goal is to select the shortest path when the network link is not loaded, and perform traffic engineering to move traffic to the other path when the network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms

Published in:

Information Networking, 2001. Proceedings. 15th International Conference on

Date of Conference: