Characterizing reference locality in the WWW
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
The authors propose models for both temporal and spatial locality of reference in streams of requests arriving at Web servers. They show that simple models based on document popularity alone are insufficient for capturing either temporal or spatial locality. Instead, they rely on an equivalent, but numerical, representation of a reference stream: a stack distance trace. They show that temporal locality can be characterized by the marginal distribution of the stack distance trace, and propose models for typical distributions and compare their cache performance to the traces. They also show that spatial locality in a reference stream can be characterized using the notion of self-similarity. Self-similarity describes long-range correlations in the data set, which is a property that previous researchers have found hard to incorporate into synthetic reference strings. They show that stack distance strings appear to be strongly self-similar, and provide measurements of the degree of self-similarity in the traces. Finally, they discuss methods for generating synthetic Web traces that exhibit the properties of temporal and spatial locality measured in the data.
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
The Fractal Geometry of Nature.
Sparrow, C., & Mandelbrot, B. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981858 · Cited by 14,546
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
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
Self-citationStatistics for Long-Memory Processes.
Ray, W. D., & Beran, J. (1996) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983481 · Cited by 2,686
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
Scale and performance in a distributed file system
Howard, J. H., Kazar, M. L., Menees, S. G., Nichols, D. A., Satyanarayanan, M., Sidebotham, R. N., & West, M. J. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.35059 · Cited by 1,403
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
Characteristics of WWW Client-based Traces
Cunha, C. R., Azer Bestavros, C., & Crovella, M. E. (1995) · OpenBU (Boston University) · Cited by 587
Self-citationCaching Proxies: Limitations and Potentials
Abrams, M., Standridge, C. R., Abdulla, G., Williams, S., & Fox, E. A. (1995) · Proceedings of the Fourth International Conference on World Wide Web · doi:10.1145/3592626.3592635 · Cited by 443
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
Cited by
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
Web usage mining: discovery and applications of usage patterns from Web data
Srivastava, J., Cooley, R., Deshpande, M., & Tan, P.-N. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846188 · Cited by 2,105
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/277851.277897 · Cited by 1,431
Self-citationA workload characterization study of the 1998 World Cup Web site
Arlitt, M., & Jin, T. (2000) · IEEE Network · doi:10.1109/65.844498 · Cited by 766
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
Efficient content location using interest-based locality in peer-to-peer systems
Sripanidkulchai, K., Maggs, B., & Zhang, H. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209237 · Cited by 579
On the scale and performance of cooperative Web proxy caching
Wolman, A., Voelker, M., Sharma, N., Cardwell, N., Karlin, A., & Levy, H. M. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319153 · Cited by 496
Changes in Web client access patterns: Characteristics and caching implications
Barford, P., Bestavros, A., Bradley, A., & Crovella, M. (1999) · World Wide Web · doi:10.1023/a:1019236319752 · Cited by 373
Self-citationWikipedia workload analysis for decentralized hosting
Urdaneta, G., Pierre, G., & van Steen, M. (2009) · Computer Networks · doi:10.1016/j.comnet.2009.02.019 · Cited by 368
An analysis of live streaming workloads on the internet
Sripanidkulchai, K., Maggs, B., & Zhang, H. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028795 · Cited by 317
Of Pins and Tweets: Investigating How Users Behave Across Image- and Text-Based Social Networks
Ottoni, R., Las Casas, D., Pesce, J. P., Meira Jr., W., Wilson, C., Mislove, A., & Almeida, V. (2014) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v8i1.14514 · Cited by 75
“To quantify locality of interest, we use the stack distance metric (Cascaval and Padua 2003; Almeida et al. 1996) to analyze each user's session timeline.”
MethodSelf-citation
Metadata
- Authors
- Almeida, V., Bestavros, A., Crovella, M., & de Oliveira, A.
- Venue
- Fourth International Conference on Parallel and Distributed Information Systems
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-24
- OpenAlex
- W2144684817
- Cited by
- 464
- References
- 14
- FWCI
- 32.25
- 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.