An Efficient Cache Algorithm for Internet Servers to Reduce Load


KIPS Transactions on Computer and Communication Systems, Vol. 8, No. 2, pp. 128-133, Apr. 2001
10.3745/KIPSTC.2001.8.2.128,   PDF Download:

Abstract

With the recent explosion in using of the Internet, the problem of caching Web objects has gained considerable importance. Caching on the Internet differs from traditional caching in several ways. Especially, the conventional caching algorithms are not well suited for the Internet caching. The poor performance is mainly due to its unfair treatment of small objects since all the objects are treated the same even though they differ in size. In this paper, we give an overview of caching policies designed for Web objects, and provide a new algorithm of our own. We also have performed trace-driven simulations about variable-size replacement algorithms, and derived a new algorithm to improve byte hit-ratio by classifying objects based on their sizes.


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. Y. Choi, J. Y. Moon and Y. W. Koo, "An Efficient Cache Algorithm for Internet Servers to Reduce Load," KIPS Journal C (2001 ~ 2012) , vol. 8, no. 2, pp. 128-133, 2001. DOI: 10.3745/KIPSTC.2001.8.2.128.

[ACM Style]
Su Yong Choi, Jin Yong Moon, and Yong Wan Koo. 2001. An Efficient Cache Algorithm for Internet Servers to Reduce Load. KIPS Journal C (2001 ~ 2012) , 8, 2, (2001), 128-133. DOI: 10.3745/KIPSTC.2001.8.2.128.