Efficient path selection for QoS routing in load balancing

被引：1

作者：

Yuen, MC ^{[1
]}

Cheung, CC ^{[1
]}

机构：

[1] City Univ Hong Kong, Dept Comp Engn & Informat Technol, Hong Kong, Hong Kong, Peoples R China

来源：

APCC 2003: 9TH ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1-3, PROCEEDINGS | 2003年

关键词：

switching and routing technologies; QoS routing; Internet;

D O I：

10.1109/APCC.2003.1274246

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：988 / 992

页数：5