Effective caching of web objects using Zipf's law

D. N. Serpanos, G. Karakostas, W. H. Wolf

Research output: Contribution to conferencePaper

37 Citations (Scopus)

Abstract

Web accesses follow Zipf's law with a good approximation, as measurements and observations indicate. This property provides an important tool in the design of web caching architectures, because it allows designers to calculate appropriate cache sizes to achieve the desired hit ratios. The appropriate cache size combined with an LFU replacement policy achieves high cache hit rates. However, LFU replaces objects based on frequency measurements of past accesses. Thus, the system achieves high hit rates only after these measurements are reliable and converge to the final Zipf distribution. In this paper, we provide an analysis using Chernoff's bound and a calculation of an upper bound of the number of initial requests that need to be processed in order to obtain measurements of popularity with high confidence and a measured Zipf distribution which converges to the correct one.

Original languageEnglish
Pages727-730
Number of pages4
Publication statusPublished - 1 Dec 2000
Event2000 IEEE International Conference on Multimedia and Expo (ICME 2000) - New York, NY, United States
Duration: 30 Jul 20002 Aug 2000

Other

Other2000 IEEE International Conference on Multimedia and Expo (ICME 2000)
CountryUnited States
CityNew York, NY
Period30/7/002/8/00

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Serpanos, D. N., Karakostas, G., & Wolf, W. H. (2000). Effective caching of web objects using Zipf's law. 727-730. Paper presented at 2000 IEEE International Conference on Multimedia and Expo (ICME 2000), New York, NY, United States.