By Topic

Efficient path selection for QoS routing in load balancing

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
$33 $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

2 Author(s)
Man-Ching Yuen ; Dept. of Comput. Eng. & Information Technol., City Univ. of Hong Kong, China ; Chi-Chung Cheung

In this paper, we propose a new efficient QoS path searching algorithm called the largest widest shortest path with limited choices (LWSP-LC) for load balancing in the Internet. This algorithm is modified from the widest shortest path (WSP) with two important modifications: our algorithm considers an addition parameter in the path selection criteria and searches the optimal path from very limited choices. By comparing with the WSP, our simulation results show that the LWSP-LC has a lower computational complexity, which is up to 100 times less than the WSP, without any performance degradation.

Published in:

Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on  (Volume:3 )

Date of Conference:

21-24 Sept. 2003