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

• Published in: IEEE/ACM transactions on networking Vol. 8; no. 3; pp. 281 - 293
• Main Authors: Li Fan, Pei Cao, Almeida, J., Broder, A.Z.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2000; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Bandwidth; Bit rate; Cache memory; Computer science; Data analysis; Directories; Economics; Inductively coupled plasma; Internet; Messages; Particle measurements; Protocol; Proxy client servers; Queries; Routing protocols; Summaries; Telecommunication traffic; Virtual prototyping
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/90.851975

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 potential hits before sending any queries. Two factors contribute to our protocol's low overhead: the summaries are updated only periodically, and the directory representations are very economical, as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that, compared to existing protocols such as the Internet cache protocol (ICP), summary cache reduces the number of intercache protocol messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratios as ICP. Hence summary cache scales to a large number of proxies. (This paper is a revision of Fan et al. 1998; we add more data and analysis in this version.).