Abstract: With the development of Internet technology, the load capacity of Internet server clusters is facing unprecedented challenges, and it is particularly important to implement a reasonable load balancing strategy. In order to achieve the best efficiency for load balancing, a consistent hash algorithm is adopted to distribute the loads of the load balancing system into a cluster. This paper analyzes the characteristics of load balancing in a cluster of servers based on microservice architecture, and proposes a method for designing and segmenting a consistent hash ring based on virtual nodes and a dynamic weight-based allocation strategy. Based on the consistent hash algorithm, load transfer between service clusters is achieved to solve the problem of load imbalance between services caused by increased service load in microservice clusters. It can prevent some services from crashing due to excessive load pressure. The experiments show that the improved load balancing strategy only has 31% load imbalance probability of the traditional consistency algorithm, and the dynamic allocation strategy has good load balancing performance, and can effectively solve the load balancing problem of microservices distributed architecture.

Key words: microservice, consistent hashing, load balancing, dynamic weight