On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Proxy caching that estimates page load delays
Selected papers from the sixth international conference on World Wide Web
Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms
Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms
GreedyDual* Web Caching Algorithm: Exploiting the Two Sources of Temporal Locality in Web Request Streams
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
Bypass Caching: Making Scientific Databases Good Network Citizens
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Cost-Aware Strategies for Query Result Caching in Web Search Engines
ACM Transactions on the Web (TWEB)
Journal of Network and Computer Applications
Algorithmic foundations of the internet: roundup
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Intelligent Naïve Bayes-based approaches for Web proxy caching
Knowledge-Based Systems
PACMan: coordinated memory caching for parallel jobs
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
An update-based step-wise optimal cache replacement for wireless data access
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Document caching on is used to improve Web performance. An efficient caching policy keeps popular documents in the cache and replaces rarely used ones. The latest web cache replacement policies incorporate the document size, frequency, and age in the decision process. The recently-proposed and very popular Greedy-Dual-Size (GDS) policy is based on document size and has an elegant aging mechanism. Similarly, the Greedy-Dual-Frequency (GDF) policy takes into account file frequency and exploits the aging mechanism to deal with cache pollution. The efficiency of a cache replacement policy can be evaluated along two popular metrics: file hit ratio and byte hit ratio. Using four different web server logs, we show that GDS-like replacement policies emphasizing size yield the best file hit ratio but typically show poor byte hit ratio, while GDF-like replacement policies emphasizing frequency have better byte hit ratio but result in worse file hit ratio. In this paper, we propose a generalization of Greedy-Dual-Frequency-Size policy which allows to balance the emphasis on size vs. frequency. We perform a sensitivity study to derive the impact of size and frequency on file and byte hit ratio, identifying parameters that aim at optimizing both metrics.