Designed by

EPIC
SOLUTIONS INTERNATIONAL

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.  
The slides from the presentation are available from the author's site in html, and from the SIGCOMM site in Powerpoint, postscript, and PDF.

ACM Copyright Notice: Copyright (c) 1998 by Association for Computing Machinery, Inc. (ACM) Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage and that the copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permission to publish from: Publications Dept. ACM, Inc. Fax +1 212 869 0481 or email <permissions@acm.org>.

The referenced paper is in Computer Communication Review, a publication of ACM SIGCOMM, volume 28, number 4, October 1998. ISSN # 0146-4833.

This electronic facsimile may differ slighty from the printed version. It has may have been reformated to better support electronic viewing. Therefore, please use the printed version when referencing layout details, such as page numbers.

This paper is available in Postscript and Adobe Portable Document Format (PDF)

Get Microsoft Powerpoint Viewer, Ghostview