A fair load-balancing QoS routing algorithm in overlay network

被引:0
作者
Cao X.-S. [1 ,2 ]
Hu R.-M. [1 ]
Wang Z.-P. [1 ]
机构
[1] School of Computer, Wuhan University
[2] Tisson Regaltec Communications Technologies Co., Ltd, Chinese Comservice
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2011年 / 34卷 / 09期
关键词
Distributed system; Load-balancing; Overlay network; QoS routing;
D O I
10.3724/SP.J.1016.2011.01650
中图分类号
学科分类号
摘要
Overlay network can achieve load balancing of distributed system by choosing lower-cost application-level paths. However, traditional methods didn't take into account the resource bottleneck of partial heavy load paths, so as to decreasing the throughput. Aiming at this problem, a fair load balancing QoS routing algorithm is proposed. The algorithm introduces a fairness resource index into the cost model, and establishes a new load-balancing utility function. At the same time, an adaptive weighting method based on system load status is used to amend the weight of QoS constraints. Experiments show that the algorithm is relatively better performance of the traditional algorithm, to effectively improve service success rate and reduce the fluctuations degree of load distribution.
引用
收藏
页码:1650 / 1659
页数:9
相关论文
共 15 条
[11]  
Jain R.K., Chiu W., Have W., A quantitive measure of fairness and discrimination for resource allocation in shared computer systems, (1984)
[12]  
Nakao A., Peterson L., Bavier A., A routing underlay for overlay networks, Proceedings of the ACM SIGCOMM'03 Conference on Computer Communications, pp. 11-18, (2003)
[13]  
Bovy C.J., Mertodimedjo H.T., Hooghiemstra G., Analysis of end-to-end delay measurements in Internet, Proceedings of the Passive and Active Measurement Workshop-PAM'2002, pp. 1-8, (2002)
[14]  
Strauss J., Katabi D., Kaashoek F., A measurement study of available bandwidth estimation tools, Proceedings of the ACM SIGCOMM Internet Measurement Conference 2003, pp. 39-44, (2003)
[15]  
Calvert K., Doar M., Zegura E., Modeling Internet topology, IEEE Transactions on Communications, 35, 6, pp. 160-163, (1997)