Abstract
Web caching is a scalable and effective way to reduce network traffic and response time. In this study, we propose a new cache replacement policy for proxy and Web servers, the Size-Adjusted Sliding Window LFU (SSW-LFU). In this policy, we use the rates of recent accesses within a sliding window to estimate the probability of future document accesses. In addition, we take into account the variable sizes of documents. Simulations with real-life web access data are conducted to evaluate the performance. SSW-LFU outperformed other algorithms in hit ratio and had comparable byte hit ratio when compared with other algorithms such as LFU, LRU, Size, LRU-Min, etc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abrams. C. Standridge, C. Abdulla, S. Wlliams, E. Fox, “Caching Proxies: Limitations and Potentials,” Proc. Fourth Int’l World Wide Web Conf., Boston, 1995.
C. Agrawal, J. Wolf, P. Yu, Caching on the World Wide Web, IEEE Transactions on Knowledge and Data Engineering, Vol. 11,No.1, February 1999.
P. Barford, A. Bestavros, A Bradley, and ME Crovella, “Changes in Web client access patterns: characteristics and caching implications,” World Wide Web, Special Issue on Characterization and Performance Evaluation. 1999.
L. Breslau, P. Cao, L. Fan, G. Phillips, S. Shenker, “Web Caching and Zipf-like Distributions: Evidence and Imnplications,” Proceedings of IEEE Infocom, 1999.
C. Cunha, A. Bestavros, and M. Crovella, “Characteristics of www Client-Based Traces,” Tech. Report TR-95-010, Computer Science Dept., Boston Univ., 1995.
P. Cao and S. Irani, “Cost-aware WWW proxy caching algorithms,” Proceedings of the 1977 USENIX Symposium on Internet Technology and Systems, pages 193–206, December 1997.
S. Glassman, “A caching relay for the world wide web,” Proc. First International World-Wide Web Conference, pages 69–76, May 1994
P. Lorenzetti, L. Rizzo, and L. Vicisano, “Replacement Policies for a Proxy Cache,” 1998. http://www.iet.unipi.it/luigi/resarch.html.
E. Markatos, “Main Memory Caching of Web Documents”, Computer Networks and ISDN Systems, Vol. 28, pp. 893–905, 1996.
J. Pitkow and M. Recken, “A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns,” GVU Technical Report No. VU-GIT-94-39; also Proc. Second Int’l WorldWide Conf, Chicago, 1994.
S. Ross, “Introduction to Probability Models,” Academic Press, 1980.
P. Scheuearmann, J. Shim, and R. Vingralek, “A Case for Delay-Conscious Caching of Web Documents,” Proc. 6th Int. World Wide Web Conference, 1997.
J. Wang, “A Survey of Web Caching Schemes for the Internet”, ACM Computer Communication Review, 29(5), 1999, 36–46.
S. Williams, M. Abrams, C.R. Standbridge, G. Abdulla and E.A. Fox, “Removal Policies in Network Caches for World-Wide Web Documents,” Proceedings of the ACM Sigcomm96, Stanford University, August 1996.
R. Wooster and M. Abrams, “Proxy Caching that Estimates Page Load Delays,” Proc. 6th Int. World Wide Web Conference, Santa Clara, CA, April 1998.
http://www.ftp.digital.com/pub/DEC/traces/proxy/webtraces.html.
http://www.ftp.digital.com/pub/DEC/traces/proxy/contrib/proxytrace2any.tar.gz.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, WC., Wang, S. (2001). Size-Adjusted Sliding Window LFU - A New Web Caching Scheme. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_56
Download citation
DOI: https://doi.org/10.1007/3-540-44759-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42527-4
Online ISBN: 978-3-540-44759-7
eBook Packages: Springer Book Archive