Load balancing of microservice clusters based on dynamic consistent hashing
In view of the shortcomings of the static load balancing algorithm and the advantages of the consistent hashing algorithm,this paper proposes a microservice cluster load balancing based on dynamic con-sistent hashing,which takes the memory usage of the server as a key element to reflect the current load of the server,so as to dynamically allocate requests to the servers on the hash ring and realize load balancing,thus effectively reducing the request delay of the system and making the system have higher availability,and effec-tively improve the service capacity and resource utilization of the system.Finally,Finally,a comparative ex-periment was conducted between the dynamic consistent hashing algorithm and the round-robin algorithm,weighted round-robin algorithm,and consistent hashing algorithm.The experimental results show that the per-formance of the dynamic consistent hash algorithm is better than that of the other three algorithms.
microservicesload balancingdynamic consistency hashingresponse time
万方数据
维普
