The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Web caching and Zipf-like distributions: evidence and implications
Abstract
This paper addresses two unresolved issues about Web caching. The first issue is whether Web requests from a fixed user community are distributed according to Zipf's (1929) law. The second issue relates to a number of studies on the characteristics of Web proxy traces, which have shown that the hit-ratios and temporal locality of the traces exhibit certain asymptotic properties that are uniform across the different sets of the traces. In particular, the question is whether these properties are inherent to Web accesses or whether they are simply an artifact of the traces. An answer to these unresolved issues will facilitate both Web cache resource planning and cache hierarchy design. We show that the answers to the two questions are related. We first investigate the page request distribution seen by Web proxy caches using traces from a variety of sources. We find that the distribution does not follow Zipf's law precisely, but instead follows a Zipf-like distribution with the exponent varying from trace to trace. Furthermore, we find that there is only (i) a weak correlation between the access frequency of a Web page and its size and (ii) a weak correlation between access frequency and its rate of change. We then consider a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution. We find that the model yields asymptotic behaviour that are consistent with the experimental observations, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesses observed by proxies. Finally, we revisit Web cache replacement algorithms and show that the algorithm that is suggested by this simple model performs best on real trace data. The results indicate that while page requests do indeed reveal short-term correlations and other structures, a simple model for an independent request stream following a Zipf-like distribution is sufficient to capture certain asymptotic properties observed at Web proxies.
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
Cost-aware WWW proxy caching algorithms
Cao, P., & Irani, S. (1997) · Cited by 925
Self-citationCoffman, E. G., & Denning, P. J. (1973) · Medical Entomology and Zoology · Cited by 694
Characteristics of WWW Client-based Traces
Cunha, C. R., Azer Bestavros, C., & Crovella, M. E. (1995) · OpenBU (Boston University) · Cited by 587
Characterizing reference locality in the WWW
Almeida, V., Bestavros, A., Crovella, M., & de Oliveira, A. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568672 · Cited by 464
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
Replacement policies for a proxy cache
Rizzo, L., & Vicisano, L. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842139 · Cited by 302
A caching relay for the World Wide Web
Glassman, S. (1994) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(94)90130-9 · Cited by 292
World Wide Web Cache Consistency
Gwertzman, J. S., & Seltzer, M. (1996) · Cited by 263
The Measured Access Characteristics of World-Wide-Web Client Proxy Caches
Duska, B. M., Marwood, D., & Feeley, M. J. (1997) · Cited by 193
Cited by
A survey on security issues in service delivery models of cloud computing
Subashini, S., & Kavitha, V. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2010.07.006 · Cited by 2,625
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Self-citationA survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Shanmugam, K., Golrezaei, N., Dimakis, A. G., Molisch, A. F., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2281606 · Cited by 1,246
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
Metadata
- Authors
- Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S.
- Venue
- 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)
- Publisher
- IEEE
- Published
- 1999
- Pages
- 126-134 vol.1
- OpenAlex
- W2112053513
- Cited by
- 3,467
- References
- 9
- FWCI
- 63.95
- 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
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.