Abstract
In this paper we study and analyze the influence of caching strategies on the performance of WWW proxies. We propose a new strategy, class-based LRU, that works recency- as well as size-based, with the ultimate aim to obtain a well-balanced mixture between large and small documents in the cache, and hence, good performance for both small and large object requests. To achieve this aim, the cache is partitioned in classes, each one assigned to a specific document size range; within a class, the classical LRU strategy is applied.
We show that for class-based LRU good results are obtained for both the hit rate and the byte hit rate, if the size of the classes and the corresponding document size ranges are well chosen. The latter is achieved by the use of a Bayesian decision rule and a characterisation of the requested object-size distribution. In doing so, class-based LRU is an adaptive strategy: a change in request patterns results, via a change in the distributions, in a change in cache partitioning and request classification. Finally, the complexity of class-based LRU is comparable to that of LRU and, therefore, smaller then of its “competitors”.
The research reported in this paper was performed while all the authors were at the RWTH Aachen, Germany. The first two authors have been supported by the German DFG, under contracts HA 2966/2-1 and HA 2966/2-2.
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
Gettys, J., Berners-Lee, T., Nielsen, H.F.: Replication and Caching Position Statement (1997), http://www.w3.org/Propagation/activity.html
Tatarinov, I., Rousskov, A., Soloviev, V.: Static caching in web servers. In: Proc. 6th IEEE Int’l Conf. on Computer Communication and Networks, pp. 410–417 (1997)
Arlitt, M.F., Friedrich, R., Jin, T.: Workload characterization of a web proxy in a cable modem. In: Proc. ACM SIGMETRICS 1999, 25–36 (1999)
Williams, S., Abrams, M., Standridge, C.R., Abdulla, G., Fox, E.A.: Removal policies in network caches for world-wide web documents. In: Proc. ACM SIGCOMM 1996, pp. 293–305 (1996)
Lorenzetti, P., Rizzo, L.: Replacement Policies for a Proxy Cache. Technical report, Universita di Pisa (1996)
Cao, P., Irani, S.: Cost-aware WWW Proxy Caching Algorithms. In: Proc. USENIX, Monterey, CA, pp. 193–206 (1997)
Kardella, R., Love, J., Wherry, B.: Caching Strategies to Improve Disk System Performance. IEEE Computer 27, 207–218 (1997)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-k page replacement algorithm for database disk buffering. In: Proc. ACM SIGMOD 1993, pp. 297–306 (1993)
Robinson, J., Devrakonda, M.: Data cache management using frequency-based replacement. In: Proc. ACM SIGMETRICS 1990, pp. 134–142 (1990)
Jin, T., Bestavros, A.: Greedy-dual* web caching algorithm: Exploiting the two sources of temporal locality in web request streams. Computer Communications 22, 174–283 (2000)
Lindemann, C., Waldhorst, O.: Evaluating the impact of different document types on the performance of web cache replacement schemes. In: Proc. IEEE Int’l Performance and Dependability Symposium, pp. 717–726 (2002)
Bahn, H., Koh, K., Noh, S.H., Min, S.L.: Efficient replacement of nonuniform objects in web caches. IEEE Computer 35, 65–73 (2002)
Ciardo, G., Riska, A., Smirni, E.: EquiLoad: a load balancing policy for clustered web servers. Performance Evaluation 46, 101–124 (2001)
El Abdouni Khayari, R., Sadre, R., Haverkort, B.R.: Fitting world-wide web request traces with the EM-Algorithm. Performance Evaluation 52, 175–191 (2003)
Celik, S.: Adaptives caching in proxy-servern. Master’s thesis, RWTH Aachen, Department of Computer Science, Aachen, Germany (2003)
Riska, A., Sun, W., Smirni, E., Ciardo, G.: AdaptLoad: effective balancing in clustered web servers under transient load conditions. In: Proc. 22nd IEEE Int’l. Conf. on Distributed Computing Systems, pp. 104–111 (2002)
Digital Equipment Cooperation: Digital’s Web Proxy Traces, ftp://ftp.digital.com/pub/DEC/traces/proxy
Arlitt, M.F., Williamson, C.L.: Internet web servers: Workload chracterization and performance implications. IEEE/ACM Transactions on Networking 5, 631–645 (1997)
Barford, P., Bestavaros, A., Bradley, A., Crovella, M.: Changes in Web Client Access Patterns. WWW Journal 2, 3–16 (1999)
Arlitt, M.F., Williamson, C.L.: Trace-driven simulation of document caching strategies for internet web servers. SCS Simulation Journal 68, 23–33 (1997)
Pistorius, M.: Caching strategies for web-servers. Master’s thesis, RWTH Aachen, Department of Computer Science, Aachen, Germany (2001)
Isenhardt, T.: Einsatz von klassenbasierten verfahren in proxy-servern. Master’s thesis, RWTH Aachen, Department of Computer Science, Aachen, Germany (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haverkort, B.R., El Abdouni Khayari, R., Sadre, R. (2003). A Class-Based Least-Recently Used Caching Algorithm for World-Wide Web Proxies. In: Kemper, P., Sanders, W.H. (eds) Computer Performance Evaluation. Modelling Techniques and Tools. TOOLS 2003. Lecture Notes in Computer Science, vol 2794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45232-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45232-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40814-7
Online ISBN: 978-3-540-45232-4
eBook Packages: Springer Book Archive