基于权重轮询负载均衡算法的优化

摘要

随着电商网站用户规模不断增长, 高并发问题成为在搭建大规模电商网站系统时面临的一项重大挑战, 通过负载均衡算法来实现Web服务集群中各节点均衡负载是解决高并发的手段之一. 然而, 目前通用的负载均衡算法都存在一些不足之处, 针对这一问题, 提出了一种动态自适应权重轮询随机负载均衡算法(Dynamic Adaptive Weight Round-Robin Random Load-Balancing, DAWRRRLB), 该算法考虑到影响Web服务集群中服务器节点性能的多重因素, 根据节点在运行过程中的实时负载情况动态的改变集群中节点的负载性能, 并结合改进的Pick-K算法对权重轮询负载均衡算法进行优化, 始终保证性能最优的服务器节点在提供服务. 通过多次实验对比, 改进的DAWRRRLB算法可以有效的提高负载均衡效率.%With the continuous growth of Internet users, the high concurrency becomes a major challenge in building large-scale electricity-business website system. To solve the problem, the load-balancing algorithm is used to realize the balanced load of each node in the Web service cluster. However, the current load-balancing algorithms generally have some shortcomings. In view of this problem, this paper proposes a dynamic adaptive weight round-robin random load-balancing algorithm (DAWRRRLB). This algorithm takes into account the multiple factors that affect the performance of the server nodes in the Web service cluster, and changes the load performance of nodes in the cluster according to the node in the operation process of the real-time dynamic load. It combines with the Pick-K algorithm to improve the dynamic adaptive weight round-robin random load-balancing algorithm, ensuring the best performance of the server node is providing services. By many experiments, the DAWRRRLB algorithm is proved to be able to effectively improve the load-balancing efficiency.