The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Caching Proxies: Limitations and Potentials
Open accessAbstract
As the number of World Wide Web users grows, so does the number of connections made to servers. This increases both network load and server load. Caching can reduce both loads by migrating copies of server files closer to the clients that use those files. Caching can either be done at a client or in the network (by a proxy server or gateway). We assess the potential of proxy servers to cache documents retrieved with the HTTP, GOPHER, FTP, and WAIS protocols using World Wide Web browsers. We monitored traffic corresponding to three types of educational workloads over a one-semester period, and used this as input to a cache simulation. Our main findings are (1) that with our workloads a proxy has a 30--50% maximum possible hit rate no matter how it is designed; (2) that when the cache is full and a document is replaced, classic least recently used (LRU) is a poor policy, but simple variations can dramatically improve hit rate and reduce cache size; (3) that a proxy server really functions as a second-level cache, and its hit rate may tend to decline with time after initial loading, given a more or less constant set of users; and (4) that certain modifications to proxy-server configuration parameters for a cache may have little benefit.
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
Tanenbaum, A. S. (1992) · Cited by 1,912
A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns
Pitkow, J. E., & Recker, M. M. (1994) · Cited by 101
Cited by
A survey of Web cache replacement strategies
Podlipnig, S., & Böszörmenyi, L. (2003) · ACM Computing Surveys · doi:10.1145/954339.954341 · Cited by 760
Internet Web servers: workload characterization and performance implications
Arlitt, M. F., & Williamson, C. L. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649565 · Cited by 730
A survey of web caching schemes for the Internet
Wang, J. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505701 · Cited by 682
Application of Machine Learning in Wireless Networks: Key Techniques and Open Issues
Sun, Y., Peng, M., Zhou, Y., Huang, Y., & Mao, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924243 · Cited by 678
“Another two well-known heuristic cache management strategies are least recently used (LRU) strategy [151] and least frequently used (LFU) strategy [152].”
MethodHierarchical Web caching systems: modeling, design and experimental results
Che, H., Tung, Y., & Wang, Z. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.801752 · Cited by 491
Metadata
- Authors
- Abrams, M., Standridge, C. R., Abdulla, G., Williams, S., & Fox, E. A.
- Venue
- Proceedings of the Fourth International Conference on World Wide Web
- Publisher
- ACM
- Published
- 1995-12-11
- Pages
- 119-133
- OpenAlex
- W1579489005
- Cited by
- 443
- References
- 2
- FWCI
- 21.77
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.