The DOI matches its Crossref record.
An overview of web caching replacement algorithms
Abstract
The increasing demand for World Wide Web (WWW) services has made document caching a necessity to decrease download times and reduce Internet traffic. To make effective use of caching, an informative decision has to be made as to which documents are to be evicted from the cache in case of cache saturation. This is particularly important in a wireless network, where the size of the client cache at the mobile terminal (MT) is small. Several types of caching are used over the Internet, including client caching, server caching, and more recently, proxy caching. In this article we review some of the well known proxy-caching policies for the Web. We describe these policies, show how they operate, and discuss the main traffic properties they incorporate in their design. We argue that a good caching policy adapts itself to changes in Web workload characteristics. We make a qualitative comparison between these policies after classifying them according to the traffic properties they consider in their designs. Furthermore, we compare a selected subset of these policies using trace-driven simulations.
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
Cited by
Shahrad, M., Fonseca, R., Goiri, Í., Chaudhry, G., Batum, P., Cooke, J., Laureano, E., Tresness, C., Russinovich, M., & Bianchini, R. (2020) · arXiv · doi:10.48550/arxiv.2003.03423 · Cited by 391
“Finally, one might think that the problem of managing cold starts is similar to managing caches of variable-sized objects, such as Web page caches and others [4, 8, 36].”
BackgroundVideo-Aware Scheduling and Caching in the Radio Access Network
Ahlehagh, H., & Dey, S. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2294111 · Cited by 271
Keep-Alive Caching for the Hawkes process
Narayana, S., & Kash, I. A. (2023) · arXiv · doi:10.48550/arxiv.2309.03521
“These are studied both for applications in settings like Content Delivery Networks (CDNs) as well as their use as a more tractable way of approximately analyzing the performance of traditional caches introduced by Che et al. [2002]. Berger et al.”
Background
Metadata
- Authors
- Balamash, A., & Krunz, M.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2004
- Volume
- 6
- Issue
- 2
- Pages
- 44-56
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2013743559
- Cited by
- 162
- References
- 0
- FWCI
- 9.03
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An overview of web caching replacement algorithms. https://app.cochat.ai/papers/10.1109/comst.2004.5342239
- The paper
- Balamash, A., & Krunz, M. (2004). An overview of web caching replacement algorithms. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2004.5342239
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.