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

  • Authors:

  • S Jin;A Bestavros

  • Affiliations:

  • Computer Science Department, Boston University, Boston, MA 02215, USA;Computer Science Department, Boston University, Boston, MA 02215, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.25

Visualization

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 identification of the relative strengths of these two sources of temporal locality in a reference stream. In [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of temporal locality. These findings underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence 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 [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University] to adjust the relative worth of long-term popularity versus short-term temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual^* when compared to other Web cache replacement policies proposed in the literature.