ACM Home Page
Please provide us with feedback. Feedback
Summary cache: a scalable wide-area Web cache sharing protocol
Full text PdfPdf (1.80 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Vancouver, British Columbia, Canada
Pages: 254 - 265  
Year of Publication: 1998
ISBN:1-58113-003-1
Also published in ...
Authors
Li Fan  Department of Computer Science, University of Wisconsin-Madison
Pei Cao  Department of Computer Science, University of Wisconsin-Madison
Jussara Almeida  Department of Computer Science, University of Wisconsin-Madison
Andrei Z. Broder  System Research Center, Digital Equipment Corporation
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 35,   Citation Count: 85
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/285237.285287
What is a DOI?

ABSTRACT

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 propose 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. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical --- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. M. Duska, D. Marwood, and M. J. Feeley, "The measured access characteristics of World-Wide-Web client proxy caches," in Proc. USENiX Syrup. on Internet Technologies and Systems, pp. 23-35, December 1997. http://www, cs. ubc. ca/spider/marwood/Proj ects/ SPA/wwwap.
 
2
"Squid intemet object cache." http://squid.nlanr .net/Squid.
 
3
R. Caceres, F. Douglis, A. Feldmann, G. Glass, and M. Rabinovich, "Web proxy caching: The devil is in the details," in Proc. Workshop on Internet Server Performance, June 1998. http: //www. cs. wisc. edu/-cao/WiSP98, html.
 
4
 
5
P. Cao and S. Irani, "Cost-aware WWW proxy caching algorithms," in Proc. USENIX Syrup. on lnternet Technoloyies and Systems, pp. 193-206, December 1997. http://www, cs. wisc. edu/-cao/papers/gd- size. html.
6
 
7
V. Cate, "Alex- A global filesystem," in Proc. USENfX File System Workshop, pp. 1-12, May 1992.
 
8
 
9
S. D. Gribble and E. A. Brewer, "System design issues for Internet middleware services: Deductions from a large client trace," in Proc. USENIX Syrup. on fnternet Technologies and Systems, December 1997. http://www, usenix, org/events/us it s97.
 
10
B. Krishnamurthy and C. E. Wills, "Study of piggyback cache validation for proxy caches in the World Wide Web," in Proc. USENIX Syrup. on Internet Technologies and Systems, pp. 1-12, December 1997. http: //www. research, att. corn/~bala/papers/ pcv-u$ it s97. ps. gz
 
11
12
13
14
15
 
16
Z. Jiang and L. Kleinrock, "Prefetching links on the WWW," in Proc. IEEE Inter. Conf. on Communications, pp. 483-489, June 1997. http://millennium, cs. ucla. edu/' j iang/Research/ Publ i cat i on/pre fet ch. ps.
 
17
M. Crovella and P. Barford, "The network effects of prefetching," in Proc. IEEE INFOCOM, pp. 1232-1240, April 1998. http: //www. cs. bu. edu/f aculty/crovella/ papers, html.
 
18
T. M. Kroeger, D. E. Long, and O. C. Mogul, "Exploring the bounds of Web latency reduction from caching and prefetching," in Proc. USENIX Syrnp. on }nternet Technologies and Systems, pp. 13-22, December 1997. http://www, cse. ucsc. edu/~ tmk/ideal, ps.
 
19
 
20
 
21
E. Cohen, B. Krishnamurthy, and J. Rexford, "Improving end-to-end performance of the web using server volumes and proxy filters," Tech. Rep. 980206-01, AT&T Labs- Research, February 1998. http://www .research. att. com/~bala/papers/ mafia-tm.ps, gz.
 
22
R. Fielding, J. Gettys, J. C. Mogul, H. Frystyk, and T. Berners-Lee, "Hypertext transfer protocol- HTTP/1.1,', Internet Draft, March 13 1998. This is a work in progress. http://www, w3. org/Prot ocols/HTTP/1.1/ draft - ietf -http-v 11-spec-rev-03. txt.
23
 
24
 
25
F. DougHs, A. Feldmann, B. Krishnamurthy, and J. Mogul, "Rate of change and other metrics: A live study of the World Wide Web," in Proc. USENIX Syrup. on Internet Technologies and Systems, pp. 147- 158, December 1997. http://www .research. art. com/-bala/papers/ roc-usits97.ps.gz
 
26

CITED BY  85

Collaborative Colleagues:
Li Fan: colleagues
Pei Cao: colleagues
Jussara Almeida: colleagues
Andrei Z. Broder: colleagues