Web server cluster system round-robin scheduling load balancing method with good fairness

Abstract

The invention discloses a Web server cluster system round-robin scheduling load balancing method with good fairness. A server scheduling module distributes load for each server according to the minimum residual weight in an active server in each round. Due to the fact that the minimum residual weight is not fixed, the minimum residual weight is selected again before each round starts, thereby having good fairness and being capable of achieving effective load balancing. On the basis of being easy to achieve the round-robin scheduling method, the Web server cluster system round-robin scheduling load balancing method improves the fairness of the Web server cluster system, particularly avoids a situation that a server with low weight can not be used for a long time, and has the advantages of being low in complex degree, high in efficiency and easy to achieve.

Description

technical field [0001] The invention belongs to the technical field of cluster servers, and in particular relates to a polling scheduling load balancing method for a Web server cluster system with good fairness. Background technique [0002] With the development of network technology and the popularization of computers, the scale of the network continues to expand, and a large number of applications are carried out around the network, which promotes the rapid growth of the number of Internet users and traffic. At the same time, with the rapid progress of network hardware equipment, the bottleneck effect of network bandwidth is weakening day by day, and the performance problems of web servers are gradually emerging. Due to the limited ability of a single server system to process customer requests, when the number of concurrent access It will cause the load of the web server to increase or even collapse. It can be seen that how to solve the high load problem of the server and ...

AI Technical Summary

Problems solved by technology

[0005] The advantage of the round-robin scheduling method is that it is very simple to implement, but there are also obvious shortcomings: the simple round-robin scheduling method does not consider the processing capacity of the server, and obviously does not Applicable to situations where server processing performance is inconsistent in a Web server cluster system

The weighted round-robin scheduling method takes into account the difference in server performance and improves the effectiveness of scheduling, but there is a fairness problem. Some servers may be heavily loaded while other servers are idle, resulting in a discrepancy between servers. unbalanced load

Images