An Improved Dynamic Smooth Weighted Round-robin Load-balancing Algorithm

• Published in: Journal of physics. Conference series Vol. 2404; no. 1; pp. 12047 - 12054
• Main Authors: Gao, Chenhao, Wu, Hengyang
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.12.2022
• Subjects: Algorithms; Design of experiments; Load balancing; Physics
• ISSN: 1742-6588; 1742-6596
• DOI: 10.1088/1742-6596/2404/1/012047

Load-balancing is a key component of highly available network infrastructure. Weighted round-robin is one of the important strategies to achieve load-balancing, which is a classic research subject. In recent years, the weighted round-robin algorithm has developed from static weight to dynamic. The Dynamic weighted round-robin algorithm needs further research in time-sensitive of dynamic weights and the rationality of results. Based on Nginx, this paper improves the dynamic weighting algorithm. Firstly, it proposes a method of dynamically calculating weights. The method determines the weight of the server in the cluster according to its theoretical performance and runtime state. Secondly, making the request allocation result more balanced and avoiding continuous centralized scheduling by an improved weighted algorithm. Experiments show that the algorithm proposed in this paper is effective and can improve system performance and load-balancing efficiency.