Summary cache: a scalable wide-area web cache sharing protocol

@inproceedings{Fan2000SummaryCA,
  title={Summary cache: a scalable wide-area web cache sharing protocol},
  author={Li Fan and Pei Cao and Jussara M. Almeida and Andrei Z. Broder},
  booktitle={TNET},
  year={2000}
}
The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we demonstrate the benefits of cache sharing, measure the overhead of the existing protocols, and propose a new protocol called "summary cache". In this new protocol, each proxy keeps a summary of the cache directory of each participating proxy, and checks these summaries for… 

Figures and Tables from this paper

The "Last-Copy" Approach for Distributed Cache Pruning in a Cluster of HTTP Proxies
TLDR
The main contribution of the proposed scheme is an algorithm that increases the performance (hit-ratio) of any cache-pruning algorithm in a loosely-coupled cluster.
Summary cache: a scalable wide-area Web cache sharing protocol
TLDR
This paper proposes a new protocol called "Summary Cache"; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries, which enables cache sharing among a large number of proxies.
Exploiting client cache: a scalable and efficient approach to build large Web cache
  • Zhiyong Xu, Yimin Hu, L. Bhuyan
  • Computer Science
    18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
  • 2004
TLDR
The simulation results show the proposed new solution to improve Web caching performance using local cache on client computers can achieve better system caching performance and scalability than the previous solutions.
Local replication for proxy web caches with hash routing
TLDR
Study of controlled local replication for hash routing, such as CARP, among a collection of loosely-coupled proxy web cache servers shows that for very large cache sizes, a larger amount of local replication can be allowed to reduce inter-cache traffic without increasing incoming traffic.
Improving Web Access Efficiency Using P2P Proxies
TLDR
This paper links the existing distributed proxy servers into a group of peer-to-peer cache proxies using a set of rules for connection, data cache and data routing to build a self-organized scalable distributed P2P proxy caching system.
Collaborative Web caching based on proxy affinities
TLDR
A new scheme which employs proxy affinities to maintain a dynamic distributed collaborative caching infrastructure is proposed which can be shown to greatly reduce the number of messages and other overhead on individual proxies while maintaining a high cache hit rate.
Web proxy cache replacement: do's, don'ts, and expectations
TLDR
A cache replacement algorithm, 'CSP', is employed, which integrates key knowledge from previous work, and a dynamic replacement algorithm is developed that continuously utilizes the best algorithm as the problem-parameter values change with time.
Performance comparison of alternative Web caching techniques
TLDR
This paper compares the performance of a number of cooperative (ICP and Cache Digest) and transparent (L5 transparent Web caching and LB-L5) Web caching techniques.
An adaptive cache coherence protocol: Trading storage for traffic
Efficient and Scalable Client Clustering for Web Proxy Cache
TLDR
This paper uses DHT based peerto-peer lookup protocol to manage the client-clustering and proposes the Backward ICP which is used to communicate between the proxy cache and theclient-cluster, to reduce the overhead of the object replication and to use the resources more efficiently.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 57 REFERENCES
Summary cache: a scalable wide-area Web cache sharing protocol
TLDR
This paper proposes a new protocol called "Summary Cache"; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries, which enables cache sharing among a large number of proxies.
The Measured Access Characteristics of World-Wide-Web Client Proxy Caches
TLDR
An analysis of access traces collected from seven proxy servers deployed in various locations throughout the Internet shows that a 2- to 10-GB second-level cache yields hit rates between 24% and 45% with 85% of these hits due to sharing among different clients.
A case for caching file objects inside internetworks
TLDR
Evidence is presented that several, judiciously placed file caches could reduce the volume of FTP traffic by 42%, and hence theVolume of all NSFNET backbone traffic by 21%, and if FTP client and server software automatically compressed data, this savings could increase to 27%.
Reduce, reuse, recycle: an approach to building large Internet caches
TLDR
It is shown that these drawbacks are easily overcome for well configured CRISP caches, and report on early studies of CRISp caches in actual use and under synthetic load.
Study of Piggyback Cache Validation for Proxy Caches in the World Wide Web
TLDR
Trace-driven simulation of this mechanism on two large, independent data sets shows that PCV both provides stronger cache coherency and reduces the request traffic in comparison to the time-to-live (TTL) based techniques currently used.
Maintaining Strong Cache Consistency in the World Wide Web
TLDR
This study compares three consistency approaches: adaptive TTL, polling-every-time and invalidation, through analysis, implementation, and trace replay in a simulated environment and shows that strong cache consistency can be maintained for the Web with little or no extra cost than the current weak consistency approaches.
Maintaining strong cache consistency in the World-Wide Web
  • Chengjie Liu, P. Cao
  • Computer Science
    Proceedings of 17th International Conference on Distributed Computing Systems
  • 1997
TLDR
It is shown that, contrary to popular belief, strong cache consistency can be maintained for the Web with little or no extra cost than the current weak consistency approaches, and it should be maintained using an invalidation based protocol.
Performance evaluation of Web proxy cache replacement policies
World Wide Web Cache Consistency
TLDR
Using trace-driven simulation, it is shown that a weak cache consistency protocol (the one used in the Alex ftp cache) reduces network bandwidth consumption and server load more than either time-to-live fields or an invalidation protocol and can be tuned to return stale data less than 5% of the time.
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.
...
1
2
3
4
5
...