Proceedings ArticleDOI
Web caching and Zipf-like distributions: evidence and implications
Lee Breslau,Pei Cao,Li Fan,G. Phillips,Scott Shenker +4 more
- Vol. 1, pp 126-134
TLDR
This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.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.read more
Citations
More filters
Posted Content
Coded Caching with Nonuniform Demands
TL;DR: A fundamentally different approach is needed, in which the cache contents are used as side information for coded communication over the shared link, and it is proposed and proved that it is close to optimal.
The Medusa Proxy A Tool For Exploring User-Perceived Web Performance
TL;DR: The Medusa proxy is a non-caching forwarding proxy used in conjunction with a user’s browser that can be used to explore userperceived Web performance using two experiments to determine to what extent using large-scale caching systems like the NLANR cache hierarchy improve user-perceived latency.
ReportDOI
On the Materialization of WebViews
TL;DR: This paper introduces the materialize on-demand approach which combines the two strategies, and generates WebViews on demand, but also stores the results and re-uses them in the future if possible.
Journal ArticleDOI
Edge Caching in Multi-UAV-Enabled Radio Access Networks: 3D Modeling and Spectral Efficiency Optimization
TL;DR: This article studies edge caching for multiple UAV-enabled radio access networks (UAV-RANs) and investigates how the overall spectral efficiency (SE) can be improved by efficient edge caching.
Proceedings ArticleDOI
Cross-Layer Design for Cooperative Caching in Mobile Ad Hoc Networks
M.K. Denko,Jun Tian +1 more
TL;DR: A cross-layer design approach is employed to improve the performance of combined cooperative caching and prefetching schemes and is maintained in a separate data structure and is shared among layers.
References
More filters
Proceedings Article
Cost-aware WWW proxy caching algorithms
Pei Cao,Sandy Irani +1 more
TL;DR: GreedyDual-Size as discussed by the authors incorporates locality with cost and size concerns in a simple and nonparameterized fashion for high performance, which can potentially improve the performance of main-memory caching of Web documents.
Book
Operating Systems Theory
TL;DR: As one of the part of book categories, operating systems theory always becomes the most wanted book.
Characteristics of WWW Client-based Traces
TL;DR: This paper presents a descriptive statistical summary of the traces of actual executions of NCSA Mosaic, and shows that many characteristics of WWW use can be modelled using power-law distributions, including the distribution of document sizes, the popularity of documents as a function of size, and the Distribution of user requests for documents.
Proceedings ArticleDOI
Characterizing reference locality in the WWW
TL;DR: The authors propose models for both temporal and spatial locality of reference in streams of requests arriving at Web servers and show that temporal locality can be characterized by the marginal distribution of the stack distance trace, and proposed models for typical distributions and compare their cache performance to the traces.
Journal ArticleDOI
Working Sets Past and Present
TL;DR: This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance and suggests that a working set dispatcher should be considered.