The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Popularity-aware greedy dual-size Web proxy caching algorithms
Abstract
Web caching aims at reducing network traffic, server load and user-perceived retrieval delays by replicating popular content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an online fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies. Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches. This trend points to the need for proxy cache replacement algorithms that directly capture popularity information. We present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy. We propose a novel cache replacement policy that uses such information to generalize the well-known greedy dual-size algorithm, and show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Self-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
Cited by
Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems
Hefeeda, M., & Saleh, O. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.918081 · Cited by 259
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State
Gong, Y., Cai, X., Sang, Q., Lu, T., Hu, C., & Cheng, D. (2026) · IEEE Transactions on Computers · doi:10.1109/tc.2026.3699453
Metadata
- Authors
- Jin, S., & Bestavros, A.
- Venue
- Proceedings 20th IEEE International Conference on Distributed Computing Systems
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-07
- Pages
- 254-261
- OpenAlex
- W2111100428
- Cited by
- 170
- References
- 1
- FWCI
- 7.04
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Popularity-aware greedy dual-size Web proxy caching algorithms. https://app.cochat.ai/papers/10.1109/icdcs.2000.840936
- The paper
- Jin, S., & Bestavros, A. (2002). Popularity-aware greedy dual-size Web proxy caching algorithms. Proceedings 20th IEEE International Conference on Distributed Computing Systems. https://doi.org/10.1109/icdcs.2000.840936
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.