A study of distributing the load of the LVS clustering system based on the dynamic weight


The KIPS Transactions:PartA, Vol. 8, No. 4, pp. 299-310, Dec. 2001
10.3745/KIPSTA.2001.8.4.299,   PDF Download:

Abstract

In this paper, we study the methodology of distributing the requests of clients based on the state of real server in the LVS(Linux virtual server) clustering system. The WLC(weighted least connection) algorithm in the LVS cluster system is studied. The load distributing algorithm which assigns a weight into each real server is devised by considering the load of real servers. The load test is executed to estimate the load of real servers using a load generating tool. Throughout the result of the experiment, we suggest new load distributing algorithm based on the usage of physical memory of each real server. It is shown that the correction potentiality of new algorithm is somewhat better than that of the WLC algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. C. Kim and Y. Rhee, "A study of distributing the load of the LVS clustering system based on the dynamic weight," The KIPS Transactions:PartA, vol. 8, no. 4, pp. 299-310, 2001. DOI: 10.3745/KIPSTA.2001.8.4.299.

[ACM Style]
Suk Chan Kim and Young Rhee. 2001. A study of distributing the load of the LVS clustering system based on the dynamic weight. The KIPS Transactions:PartA, 8, 4, (2001), 299-310. DOI: 10.3745/KIPSTA.2001.8.4.299.