Web cache replacement policies: a pragmatic approach

@article{Wong2006WebCR,
  title={Web cache replacement policies: a pragmatic approach},
  author={K. Wong},
  journal={IEEE Network},
  year={2006},
  volume={20},
  pages={28-34}
}
  • K. Wong
  • Published 2006
  • Computer Science
  • IEEE Network
Research involving Web cache replacement policy has been active for at least a decade. In this-article we would like to claim that there is a sufficient number of good policies, and further proposals would only produce minute improvements. We argue that the focus should be fitness for purpose rather than proposing any new policies. Up to now, almost all policies were purported to perform better than others, creating confusion as to which policy should be used. Actually, a policy only performs… Expand

Tables and Topics from this paper

Bandit-based Run-time Adaptation of Cache Replacement Policies in Content Management Systems
TLDR
An adaptation mechanism (DETACH) that utilizes a multi-armed bandit approach to adapt the replacement policy depending on a new metric, the rank of evicted objects, which indirectly characterizes run-time request patterns is described. Expand
A Novel Hybrid Policyfor Web Caching 18
-Web caching is one of the most successful solutions for improving the performance of Webbased system by keeping Web objects that are likely to be used in the near future close to the clients. TheExpand
A Novel Hybrid Policyfor Web Caching
TLDR
A Novel Hybrid Replacement Policy for Web Caching is proposed which is an efficient combination of two traditional well- known policies, Least Recently Used (LRU) and Least Frequently Used (LFU) which gives better performance characteristics over other two policies used individually. Expand
The need for a unified framework for evaluating web cache replacement strategies
TLDR
This paper surveys the existing efforts and attempts towards a unified evaluation framework that can be used to assess various cache replacement strategies in a wider spectrum of scenarios, and raises some points that it thinks are worth to consider in developing such a benchmarking tool. Expand
Web Proxy Caching Object Replacement: Frontier Analysis to Discover the Good-Enough Algorithms
TLDR
The methodology of Data Envelopment Analysis is recommended as a powerful tool, with a complementary activity to that of trace driven simulation, which is able to discover the set of the `good-enough' replacement strategies - i.e. strategies that exhibit good results for the basic performance metrics - under a variety of simulated workloads. Expand
Web Proxy Cache Replacement Strategies
  • H. ElAarag
  • Computer Science
  • SpringerBriefs in Computer Science
  • 2013
TLDR
A novel approach to web proxy cache replacement that uses neural networks for decision making is described, its performance and decision structures are evaluated, and its implementation in a real environment is examined, namely, in the Squid proxy server. Expand
Optimization of Cache Size with Cache Replacement Policy for effective System Performance
The exponential growth of information in the internet over the last decade forces the researchers to think alternate solutions to provide better user service, reduce network bandwidth and reducedExpand
A quantitative study of Web cache replacement strategies using simulation
TLDR
This study simulates 27 proxy cache replacement strategies and introduces a new performance metric, the object removal rate, which is an indication of CPU usage and disk access at the proxy server, particularly for busy cache servers or servers with lower processing power. Expand
A Novel Cache Replacement Policy for Web Proxy Caching System Using Web Usage Mining
TLDR
The proposed policy includes size, cost, frequency, ageing, time of entry into the cache and popularity of Web objects in cache removal policy, which uses the Web usage mining as a technique to improve Web caching policy. Expand
Impact of traffic distribution on web cache performance
TLDR
This article analyses real logs obtained from the client layer of high traffic websites and shows that under these conditions, the cache hit ratio can be extremely high with a very small cache size. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Replacement policies for a proxy cache
TLDR
This paper proposes a novel replacement policy, called LRV, which selects for replacement the document with the lowest relative value among those in cache, and shows how LRV outperforms least recently used (LRU) and other policies and can significantly improve the performance of the cache, especially for a small one. Expand
An overview of web caching replacement algorithms
TLDR
It is argued that a good caching policy adapts itself to changes in Web workload characteristics, and makes a qualitative comparison between these policies after classifying them according to the traffic properties they consider in their designs. Expand
Site-Based Approach to Web Cache Design
A site-based approach to Web caching tracks documents by site rather than individual document names or URLs, bringing different benefits to several different types of applications. One problem,Expand
Removal Policies in Network Caches for World-Wide Web Documents
TLDR
Surprisingly, the criteria used by several proxy-server removal policies are among the worst performing criteria in the authors' simulation; instead, replacing documents based on size maximizes hit rate in each of the studied workloads. Expand
Removal Policies in Network Caches for World-Wide Web Documents
TLDR
Surprisingly, the criteria used by several proxy-server removal policies are among the worst performing criteria in the authors' simulation; instead, replacing documents based on size maximizes hit rate in each of the studied workloads. Expand
On the sensitivity of Web proxy cache performance to workload characteristics
  • M. Busari, C. Williamson
  • Computer Science
  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
This paper describes the design and use of a synthetic Web proxy workload generator (ProWGen) to investigate the sensitivity of proxy cache replacement policies to selected Web workloadExpand
A survey of Web cache replacement strategies
TLDR
This article proposes a classification for proposals for cache replacement that subsumes prior classifications and discusses the importance of cache replacement strategies in modern proxy caches and outlines potential future research topics. Expand
A Web Caching Primer
TLDR
The article provides a primer on Web resource caching, one technology used to make the Web scalable and a high-level argument for the value of Web caching to content consumers and producers. Expand
Efficient Replacement of Nonuniform Objects in Web Caches
TLDR
The authors present the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments. Expand
Web caching and Zipf-like distributions: evidence and implications
  • L. Breslau, P. Cao, L. Fan, Graham Phillips, S. Shenker
  • Computer Science
  • 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)
  • 1999
TLDR
This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies. Expand
...
1
2
3
...