Cluster load balancing algorithm based on dynamic consistent hash

Abstract

In server clusters, the static scheduling algorithm has superior performance when the user visits are relatively stable. In the face of sudden increase in user traffic, the dynamic scheduling algorithm has a better load balancing effect than the static scheduling algorithm. However, in the face of complex network environments, the static scheduling algorithm cannot adjust the load according to the performance of the server in real time. The dynamic scheduling algorithm using a single weight to evaluate server performance is unreliable, and load scheduling with reference to the number of connections has uncertainty. In view of this problem, this paper proposes a cluster load balancing algorithm based on dynamic consistent hash based on the study of load balancing based on LVS clusters. By analyzing the performance and load parameters, we divide the request process into in-cycle and out-of-cycle. By setting up the LVS cluster system, the performance weights, load parameters, number of virtual nodes and cycles of the algorithm in this paper are determined experimentally. Finally, the response time and throughput of the algorithm in this paper are compared with the WRR algorithm and WLC algorithm. The results show that the time and throughput of this algorithm are better than WRR algorithm and WLC algorithm.