Abstract
In this paper, we interest in web cache replacement policies namely “frequency-aware” policies that provide, generally, the best results in term of data movement reduction in the network. For the simple reason that they take into account one of the most significant web traffic characteristic “the access frequency”. However, the access frequency suffers from two main problems namely one-timer documents existence and cache pollution. Therefore, our aim is to replace the traditional frequency with a relative frequency; calculated using the access number and the document lifetime in the cache. Although the idea already exists in the literature, we strive to validate the relative frequency efficiency for the web proxy replacement policies. In this work, we implement three replacement policies namely least frequently used (LFU), least frequently used with dynamic aging (LFU-DA) and Greedy dual size frequency (GDSF). As well, their versions enhanced with relative frequency namely LFRU, LFRU-DA and GDSFR respectively are implemented and evaluated using synthetic and real workload. The simulation results show that the relative frequency is more effective, in terms of hit rate and byte hit rate, than the access number; i.e., the traditional frequency. Moreover, the simulation proves that the relative frequency solves the access frequency problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abad P, Prieto P, Puente V, Gregorio JA (2015) Improving last level shared cache performance through mobile insertion policies (MIP). Parallel Comput J 49(C):13–27
Abdullahi I, Arif S, Hassan S (2015) Survey on caching approaches in information centric networking. J Netw Comput Appl 56(C):48–59
Abrams M, Stanbridge C, Abdulla G, Williams S, Fox E (1995) Caching proxies: limitation and potentials. In: Proceedings of the 4th international conference on World Wide Web, pp 119–133
Ali W, Shamsuddin SM, Ismail AS. 2011a. A survey of web caching and prefetching. Int J Adv Soft Comput Appl 3(1)
Ali W, Shamsuddin S, Ismail A. 2011b. Intelligent web proxy caching approaches based on support vector machine, informatics engineering and information science book. Springer, Berlin, pp 559–572
Ali W, Sulaiman S, Ahmad N (2014) Performance improvement of least-recently-used policy in web proxy cache replacement using supervised machine learning. Int J Adv Soft Comput Appl 6(1):1–38
Arlitt M, Williamson C (1997) Trace-driven simulation of document caching strategies for internet web servers. Simul J 68(1):23–33
Arlitt M, Friedrich R, Jin T (1998) Performance evaluation of web proxy cache replacement policies, Hewlett-Packard Technical Report “HPL-98-97(R.1)”, Internet Systems and Applications Laboratory
Arlitt M, Cherkasova L, Dilley J, Friedrich R, Jin T (1999) Evaluating content management techniques for web proxy caches. In: Proceeding of the 2nd workshop on internet server performance WISP’99
Busari M, Williamson C (2002) ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches. Comput Networks 38 No(6):779–794
Cao P, Irani S (1997) Cost-aware www proxy caching algorithms. In: Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS’97), 193–206
Cohen R, Dabran I (2002) The “last copy” approach for distributed cache pruning in a cluster of HTTP proxies*, Book: protocols for high speed networks. In: Proceedings of the 7th IFIP/IEEE international workshop, pp 84–99
Do CT, Kim J, Hwang I, Kim S, Ch Hong Kim (2014) A novel last-level cache replacement policy to improve the performance of mobile systems. Adv Sci Technol Lett 46(Mobile and Wireless 2014):24–28
ElAarag H (2013) A quantitative study of web cache replacement strategies using simulation. In: Web proxy cache replacement strategies. Springer, London, pp 17–60
Kaya CC, Zhang G, Tan Y, Mookerjee VS (2009) An admission-control technique for delay reduction in proxy caching. Decis Support Syst 46(2):594–603
Kumar C, Norris JB (2008) A new approach for a proxy-level web caching mechanism. Decis Support Syst 46(1):52–60
Lee D, Choi J, Kim J, Noh SH, Min SL, Cho Y, Kim CS (2001) LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. J IEEE Trans Comput 50(12):1352–1361
Pitkow J, Recker M (1994) A simple yet robust caching algorithm based on dynamic access patterns. In: Proceedings of the 2nd international conference on WWW, 1039–1046
Sajeev G, Sebastian M (2011) A novel content classification scheme for web caches. Evol Syst 2(2):101–118
Vakali A (2000) Lru-based algorithms for web cache replacement. In: Proceedings of the first international conference on electronic commerce and web technologies EC-WEB ‘00, 409–418
Wang J (1999) A survey of web caching schemes for the internet. ACM SIGCOMM Comput Commun Rev 29(5):36–46
Williams A, Arlitt M, Williamson C, Barker K (2005) Web workload characterization: ten years later. Web Inf Syst Eng Internet Technol Book Ser 2:3–21
Yanev K (2005) Cache replacement algorithms in web caches: caching of various media types. Master’s Thesis, HELSINKI University, Department of Computer Science
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Benhamida, N., Bouallouche-Medjkoune, L. & Aïssani, D. Simulation evaluation of a relative frequency metric for web cache replacement policies. Evolving Systems 9, 245–254 (2018). https://doi.org/10.1007/s12530-017-9194-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12530-017-9194-8