GreedyDual* Web caching algorithm: exploiting the two sources of temporal locality in Web request streams

Abstract

The relative importance of long-term popularity and short-term temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of temporal locality that enables the identi cation of the relative strengths of these two sources of temporal locality in a reference stream. In [21], we have proposed such a metric and have shown that Web reference streams di er signi cantly in the the prevelance of these two sources of temporal locality. These ndings underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevelance of these two sources of temporal locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual*, which is a generalization of GreedyDual-Size. GreedyDual* uses the metrics proposed in [21] to adjust the relative worth of long-term popularity versus short-term temporal correlation of references. Our tracedriven simulation experiments show the superior performance of GreedyDual* when compared to other Web cache replacement policies proposed in the literature.

DOI: 10.1016/S0140-3664(00)00312-1

9 Figures and Tables

Statistics

02040'01'03'05'07'09'11'13'15'17
Citations per Year

215 Citations

Semantic Scholar estimates that this publication has 215 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Jin2001GreedyDualWC, title={GreedyDual* Web caching algorithm: exploiting the two sources of temporal locality in Web request streams}, author={Shudong Jin and Azer Bestavros}, journal={Computer Communications}, year={2001}, volume={24}, pages={174-183} }