A Design and Performance Analysis of Web Cache Replacement Policy Based on the Size Heterogeneity of the Web Object


KIPS Transactions on Computer and Communication Systems, Vol. 12, No. 3, pp. 443-448, Jun. 2005
10.3745/KIPSTC.2005.12.3.443,   PDF Download:

Abstract

Efficient using of the web cache is becoming important factors that decide system management efficiency in the web base system. The cache performance depends heavily on the replacement algorithm, which dynamically selects a suitable subset of objects for caching in a finite cache space. In this paper, the web caching algorithm is proposed for the efficient operation of the web base system. The algorithm is designed based on a divided scope that considered size reference characteristic and heterogeneity on web object. With the experiment environment, the algorithm is compared with conservative replacement algorithms, we have confirmed more than 15% of an performance improvement.


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]
Y. J. Na, I. S. Ko and D. U. Cho, "A Design and Performance Analysis of Web Cache Replacement Policy Based on the Size Heterogeneity of the Web Object," KIPS Journal C (2001 ~ 2012) , vol. 12, no. 3, pp. 443-448, 2005. DOI: 10.3745/KIPSTC.2005.12.3.443.

[ACM Style]
Yun Ji Na, Il Seok Ko, and Dong Uk Cho. 2005. A Design and Performance Analysis of Web Cache Replacement Policy Based on the Size Heterogeneity of the Web Object. KIPS Journal C (2001 ~ 2012) , 12, 3, (2005), 443-448. DOI: 10.3745/KIPSTC.2005.12.3.443.