An Adaptive Weighted Least-Load Balancing Algorithm Based on Server Cluster

Ying-hui Wu, S. Luo, Qing Li
{"title":"An Adaptive Weighted Least-Load Balancing Algorithm Based on Server Cluster","authors":"Ying-hui Wu, S. Luo, Qing Li","doi":"10.1109/IHMSC.2013.60","DOIUrl":null,"url":null,"abstract":"In order to resolve problems such as server's weight described inaccurately, load balancing schedule inefficiently and so on, which exist in the traditional load balancing algorithms Based on server cluster, a kind of adaptive weighted least-load balancing algorithm is founded in this article. The server nodes are divided into mild load nodes and non-mild load nodes. The servers are polled in the cluster, and the mild load node is selected to response users' requests directly when user-connection requests arrival. If there are no mild load nodes in the cluster, weights are adjusted adaptively according to the server connection status, and the nodes are selected which has the minimum ratio of weight to load to provide service. Through simulation on OPNET Modeler, the results indicate that the new proposed algorithm can reduce the service delay, improve the average response rate, and balance servers' load in the cluster effectively.","PeriodicalId":222375,"journal":{"name":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2013.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In order to resolve problems such as server's weight described inaccurately, load balancing schedule inefficiently and so on, which exist in the traditional load balancing algorithms Based on server cluster, a kind of adaptive weighted least-load balancing algorithm is founded in this article. The server nodes are divided into mild load nodes and non-mild load nodes. The servers are polled in the cluster, and the mild load node is selected to response users' requests directly when user-connection requests arrival. If there are no mild load nodes in the cluster, weights are adjusted adaptively according to the server connection status, and the nodes are selected which has the minimum ratio of weight to load to provide service. Through simulation on OPNET Modeler, the results indicate that the new proposed algorithm can reduce the service delay, improve the average response rate, and balance servers' load in the cluster effectively.
基于服务器集群的自适应加权最小负载均衡算法
为了解决传统的基于服务器集群的负载均衡算法中存在的服务器权重描述不准确、负载均衡调度效率低下等问题,本文提出了一种自适应加权最小负载均衡算法。服务器节点分为轻度负载节点和非轻度负载节点。在集群中轮询服务器,当用户连接请求到达时,选择轻度负载节点直接响应用户请求。当集群中没有轻负载节点时,系统会根据服务器的连接状态自适应调整权重,选择负载权重比最小的节点提供服务。通过在OPNET Modeler上的仿真,结果表明该算法能够有效地减少服务延迟,提高平均响应速率,平衡集群中服务器的负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信