Web cache management based on the expected cost of web objects

With the recent explosion in usage of the World Wide Web, Web caching has become increasingly important. However, due to the non-uniform cost/size property of data objects in this environment, design of an efficient caching algorithm becomes an even more difficult problem compared to the traditional caching problems. In this paper, we propose the Least Expected Cost (LEC) replacement algorithm for Web caches that provides a simple and robust framework for the estimation of reference probability and fair evaluation of non-uniform Web objects. LEC evaluates a Web object based on its cost per unit size multiplied by the estimated reference probability of the object. This results in a normalized assessment of the contribution to the cost-savings ratio, leading to a fair replacement algorithm. We show that this normalization method finds optimal solution under some assumptions. Trace-driven simulations with actual Web cache logs show that LEC offers the performance of caches more than twice its size compared with other algorithms we considered. Nevertheless, it is simple, having no parameters to tune. We also show how the algorithm can be effectively implemented as a Web cache replacement module.

[1]  Edward A. Fox,et al.  Removal Policies in Network Caches for World-Wide Web Documents , 1996, SIGCOMM.

[2]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[3]  Marc Abrams,et al.  Proxy Caching That Estimates Page Load Delays , 1997, Comput. Networks.

[4]  Sang Lyul Min,et al.  On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies , 1999, SIGMETRICS '99.

[5]  Peter Scheuermann,et al.  Proxy Cache Algorithms: Design, Implementation, and Performance , 1999, IEEE Trans. Knowl. Data Eng..

[6]  Edward A. Fox,et al.  Caching Proxies: Limitations and Potentials , 1995, WWW.

[7]  Martin F. Arlitt,et al.  Evaluating content management techniques for Web proxy caches , 2000, PERV.

[8]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[10]  Sang Lyul Min,et al.  Efficient Replacement of Nonuniform Objects in Web Caches , 2002, Computer.

[11]  Saied Hosseini-Khayat,et al.  On Optimal Replacement of Nonuniform Cache Objects , 2000, IEEE Trans. Computers.

[12]  Azer Bestavros,et al.  Popularity-aware greedy dual-size Web proxy caching algorithms , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[13]  Terence Kelly,et al.  Biased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User Value , 1999 .

[14]  Azer Bestavros,et al.  GreedyDual* Web caching algorithm: exploiting the two sources of temporal locality in Web request streams , 2001, Comput. Commun..

[15]  Luigi Rizzo,et al.  Replacement policies for a proxy cache , 2000, TNET.

[16]  Philip S. Yu,et al.  Caching on the World Wide Web , 1999, IEEE Trans. Knowl. Data Eng..

[17]  Gerhard Weikum,et al.  The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.

[18]  Sang Lyul Min,et al.  Using Full Reference History for Efficient Document Replacement in Web Caches , 1999, USENIX Symposium on Internet Technologies and Systems.