Improving the performances of proxy replacement policies by considering infrequent objects

Abstract

In this paper, we perform a careful study of the effect of infrequent objects on the performance of many well-known web proxy cache replacement policies including LRU, LFU, GDSF, and LFD (an offline policy). Using a "frequency-aware" version of these policy (one that is aware of these infrequent objects), we show that significant improvement in the performance (hit rates and byte hit rates) can potentially be achieved. We also present LRU-Pred, which is a modified LRU replacement policy that attempts to predict single access objects that it will not cache. The algorithm, though simple, achieve better performance than LRU. The results are encouraging and point to more research on designing more sophisticated replacement policies that can predict infrequent objects. Copyright 2006 ACM.