Abstract
Clustering the replicated Web servers is appropriate way to build a Web information system. An LVS(Linux Virtual Server) operating with software clustering technology provides the Web service based on Linux environment. The LVS is the centralized structure, which the load should be distributed to the real servers by a load balancer. A round-robin scheduling method or a least-connection scheduling method may cause a load imbalance amongst the real servers since such methods distribute the load to the real servers without considering the actual load of real servers. In this paper, we propose a fair load distribution scheme that can distribute the requests even fair than ABSS that was early proposed to solve the problem of scheduling methods in the LVS.
Original language | English |
---|---|
Pages (from-to) | 143-152 |
Number of pages | 10 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 2918 |
Publication status | Published - 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science