Analysis And Improvement For The Dynamic Load-balancing Algorithm Of Linux Virtual Server

With the explosive growth of the Internet and its increasingly important role in our lives, the traffic on the Internet is increasing dramatically, which has been growing at over 100% annual rate. The workload on the servers is increasing rapidly so that servers will be easily overloaded for a short time, especially for a popular web site which provides www/ftp service. To overcome the overloading problem of the servers, there are two solutions. One is the single server solution, i.e. to upgrade the server to a higher performance server, but it will soon be overloaded when requests increases so that we have to upgrade it again, the upgrading process is complex and the cost is high.The other is the multiple server solution, i.e. to build a scalable network service system on a cluster of servers. When load increases, we can simply add a new server or more into cluster to meet the increasing requests, and commodity server is of highest performance/cost ratio. Therefore, if is more scalable and more cost-effective to build server cluster system for network services.In cluster system, the director does the job to assign the work load to each server with the support of the backup system. When director breaks down, the backup system can immediately replace the current service with a backup server.Linux virtual server is the technology built on a cluster system which can be used to overcome the overloading problem of the servers. Since the technology of linux virtual server is not perfect, I would like to bring forward the new algorithm for weighted least-connection scheduling which called weighted load-factor scheduling algorithm through a completed analysis for LVS dynamic load-balancing algorithm. Then I realized my idea in linux kernel so as to improve the efficiency of linux virtual server cluster system.