Options
Efficient path selection for QoS routing in load balancing
Author(s)
Date Issued
2003
Publisher
IEEE
ISBN
0780381149
Citation
Yuen, M. C., & Cheung, C. C. (2003). Efficient path selection for QoS routing in load balancing. In APCC (Ed.). 9th Asia-pacific conference on communications (IEEE cat. no.03EX732) vol. 3. 9th Asia-Pacific Conference on Communications, Penang, Malaysia (pp. 988-992). IEEE.
Type
Conference Paper
Abstract
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.
Loading...
Availability at HKSYU Library
