The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Summary cache: a scalable wide-area Web cache sharing protocol
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 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.).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Self-citationSelf-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Cost-aware WWW proxy caching algorithms
Cao, P., & Irani, S. (1997) · Cited by 925
Self-citationWeb server workload characterization: the search for invariants
Arlitt, M. F., & Williamson, C. L. (1996) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/233008.233034 · Cited by 747
Characteristics of WWW Client-based Traces
Cunha, C. R., Azer Bestavros, C., & Crovella, M. E. (1995) · Cited by 526
Cluster-based scalable network services
Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., & Gauthier, P. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266662 · Cited by 522
Handbook of algorithms and data structures
Gonnet, G. H. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 436
Implementing global memory management in a workstation cluster
Feeley, M. J., Morgan, W. E., Pighin, E. P., Karlin, A. R., Levy, H. M., & Thekkath, C. A. (1995) · doi:10.1145/224056.224072 · Cited by 337
Rate of change and other metrics: a live study of the world wide web
Douglis, F., Feldmann, A., Krishnamurthy, B., & Mogul, J. C. (1997) · Cited by 319
Replacement policies for a proxy cache
Rizzo, L., & Vicisano, L. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842139 · Cited by 302
Adaptive web caching: towards a new global caching architecture
Michel, S., Nguyen, K., Rosenstein, A., Zhang, L., Floyd, S., & Jacobson, V. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00246-3 · Cited by 276
World Wide Web Cache Consistency
Gwertzman, J. S., & Seltzer, M. (1996) · Cited by 263
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1996) · Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '96 · doi:10.1145/233013.233038 · Cited by 262
Some applications of Rabin’s fingerprinting method
Broder, A. Z. (1993) · Sequences II · doi:10.1007/978-1-4613-9323-8_11 · Cited by 204
Self-citationThe Measured Access Characteristics of World-Wide-Web Client Proxy Caches
Duska, B. M., Marwood, D., & Feeley, M. J. (1997) · Cited by 193
Supporting cooperative and personal surfing with a desktop assistant
Marais, H., & Bharat, K. A. (1997) · ACM Symposium on User Interface Software and Technology (UIST) · doi:10.1145/263407.263531 · Cited by 58
Cited by
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Self-citationFlipping bits in memory without accessing them: an experimental study of DRAM disturbance errors
Kim, Y., Daly, R., Kim, J., Fallin, C., Lee, J. H., Lee, D., Wilkerson, C., Lai, K., & Mutlu, O. (2014) · ACM SIGARCH Computer Architecture News · doi:10.1145/2678373.2665726 · Cited by 921
Ad click prediction: a view from the trenches
McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., et al. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2488200 · Cited by 867
Cuckoo Filter: Practically Better Than Bloom
Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014) · Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies · doi:10.1145/2674005.2674994 · Cited by 737
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Metadata
- Authors
- Fan, L., Cao, P., Almeida, J., & Broder, A. Z.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2000-06
- Volume
- 8
- Issue
- 3
- Pages
- 281-293
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2126540423
- Cited by
- 1,811
- References
- 18
- FWCI
- 53.70
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.