• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Summary cache: A scalable wide-area web cache sharing protocol (1998)

Cached

  • Download as a PDF

Download Links

  • [www.ece.eng.wayne.edu]
  • [www.acm.org]
  • [www.sigcomm.org]
  • [netlab18.cis.nctu.edu.tw]
  • [www.ssrc.ucsc.edu]
  • [www.utdallas.edu]
  • [www.utdallas.edu]
  • [www.cs.wisc.edu]
  • [www.cs.utah.edu]
  • [www.cs.gmu.edu]
  • [www-2.cs.cmu.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.columbia.edu]
  • [www.cs.wisc.edu]
  • [cs.nyu.edu]
  • [pages.cs.wisc.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Li Fan , Pei Cao , Jussara Almeida , Andrei Z. Broder
Citations:894 - 3 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Fan98summarycache:,
    author = {Li Fan and Pei Cao and Jussara Almeida and Andrei Z. Broder},
    title = {Summary cache: A scalable wide-area web cache sharing protocol},
    institution = {},
    year = {1998}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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.

Keyphrases

summary cache    scalable wide-area web cache    hence summary cache    prototype implementation    internet cache protocol    alleviate network bottleneck    potential hit    trace-driven simulation    bandwidth consumption    new protocol    web proxy    large number    cached document    low overhead    hit ratio    summary representation    inter-cache message    important technique    web traffic    cpu overhead   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University