Generational replacement schemes for a WWW caching proxy server

Osawa, Noritaka; Yuba, Toshitsugu; Hakozaki, Katsuya

doi:10.1007/bfb0031665

Cited by 7 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This strategy requires a parameter which determines what percentage of the cache space is allocated to the protected segment. -Generational Replacement [Osawa et al 1997]. All objects are stored in n(n > 1) lists.…”

Section: Recency/frequency-based Strategiesmentioning

confidence: 99%

A survey of Web cache replacement strategies

2003

View full text Add to dashboard Cite

Web caching is an important technique to scale the Internet. One important performance factor of Web caches is the replacement strategy. Due to specific characteristics of the World Wide Web, there exist a huge number of proposals for cache replacement. This article proposes a classification for these proposals that subsumes prior classifications. Using this classification, different proposals and their advantages and disadvantages are described. Furthermore, the article discusses the importance of cache replacement strategies in modern proxy caches and outlines potential future research topics.

show abstract

Section: Recency/frequency-based Strategiesmentioning

confidence: 99%

A survey of Web cache replacement strategies

2003

View full text Add to dashboard Cite

show abstract

“…Similarly to SACS, recency-frequency based algorithms [18,30,31] combine recency with frequency (and, possibly, other factors). SACS sets itself apart from the algorithms in this group by emphasizing distance over recency or frequency, which allows it to base its predictions of future accesses not only on past behaviour, but also on semantic knowledge.…”

Section: Related Workmentioning

confidence: 99%

An adaptive semantics-aware replacement algorithm for web caching

Negrão

Roque

Ferreira

et al. 2015

J Internet Serv Appl

View full text Add to dashboard Cite

As the web expands its overwhelming presence in our daily lives, the pressure to improve the performance of web servers increases. An essential optimization technique that enables Internet-scale web servers to service clients more efficiently and with lower resource demands consists in caching requested web objects on intermediate cache servers. At the core of the cache server operation is the replacement algorithm, which is in charge of selecting, according to a cache replacement policy, the cached pages that should be removed in order to make space for new pages. Traditional replacement policies used in practice take advantage of temporal reference locality by removing the least recently/frequently requested pages from the cache. In this paper we propose a new solution that adds a spatial dimension to the cache replacement process. Our solution is motivated by the observation that users typically browse the Web by successively following the links on the web pages they visit. Our system, called SACS, measures the distance between objects in terms of the number of links necessary to navigate from one object to another. Then, when replacement takes place, objects that are distant from the most recently accessed pages are candidates for removal; the closest an object is to a recently accessed page, the less likely it is to be evicted. We have implemented a cache server using SACS and evaluated our solution against other cache replacement strategies. In this paper we present the details of the design and implementation of SACS and discuss the evaluation results obtained.

show abstract

“…2. Generational Replacement [12]: This strategy uses n LRU lists, where n > 1. Upon being added to the cache, an object is added to the head of the first list.…”

Section: Frequency/recency Based Strategiesmentioning

confidence: 99%

A quantitative study of recency and frequency based web cache replacement strategies

Romano

ElAarag

2008

Proceedings of the 11th Communications and Networking Simulation Symposium

View full text Add to dashboard Cite

There are many replacement strategies to consider when designing a web cache server. The most commonly known cache replacement strategies are Least Frequently Used (LFU) and Least Recently Used (LRU). Though comprehensive surveys exist, no known study has presented comparative performance measures of these strategies together. We will review and describe proxy cache replacement strategies based on the recency, frequency, and size attributes of web objects, and present two performance measures. Simulation results ranked by the two performance metrics, hit rate and byte hit rate, reveal strong inductions about current cache replacement strategies.

show abstract

Generational replacement schemes for a WWW caching proxy server

Cited by 7 publications

References 8 publications

A survey of Web cache replacement strategies

A survey of Web cache replacement strategies

An adaptive semantics-aware replacement algorithm for web caching

A quantitative study of recency and frequency based web cache replacement strategies

Contact Info

Product

Resources

About