Hashing Method with Dynamic Server Information for Load Balancing on a Scalable Cluster of Cache Servers


The KIPS Transactions:PartA, Vol. 14, No. 5, pp. 269-278, Oct. 2007
10.3745/KIPSTA.2007.14.5.269,   PDF Download:

Abstract

Caching in a cache server cluster environment has an advantage that minimizes the request and response time of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache servers since each cache server should keep all the cache data.The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing and the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o.


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]
H. K. Kwak and K. S. Chung, "Hashing Method with Dynamic Server Information for Load Balancing on a Scalable Cluster of Cache Servers," The KIPS Transactions:PartA, vol. 14, no. 5, pp. 269-278, 2007. DOI: 10.3745/KIPSTA.2007.14.5.269.

[ACM Style]
Hu Keun Kwak and Kyu Sik Chung. 2007. Hashing Method with Dynamic Server Information for Load Balancing on a Scalable Cluster of Cache Servers. The KIPS Transactions:PartA, 14, 5, (2007), 269-278. DOI: 10.3745/KIPSTA.2007.14.5.269.