Improving the performances of proxy cache replacement policies by considering infrequent objects

Authors:
Hon Wai Leong;Bo Guan
Affiliations:
National University of Singapore, Singapore;National University of Singapore, Singapore
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 4
Cited 1

A caching relay for the World Wide Web

Selected papers of the first conference on World-Wide Web
Mining web logs for prediction models in WWW caching and prefetching

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Web caching and replication

Web caching and replication
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

Using data envelopment analysis to evaluate the efficiency of web caching object replacement strategies

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

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.