A.: Greedydual* web caching algorithm – exploiting the two sources of temporal locality in web request streams

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 identication 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 refer-ence streams dier signicantly 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 re-placement 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 ver-sus short-term temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual * when compared to other Web cache replace-ment policies proposed in the literature.