scispace - formally typeset
Proceedings ArticleDOI

Web caching and Zipf-like distributions: evidence and implications

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

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Redundancy in network traffic: findings and implications

TL;DR: A new redundancy elimination algorithm based on Winnowing is presented that outperforms the widely-used Rabin fingerprint-based algorithm by 5-10% on most traces and by as much as 35% in some traces, implying that pushing redundancy elimination capability to the end hosts could obtain most of the middlebox's bandwidth savings.
Journal ArticleDOI

Deep Reinforcement Learning for Cooperative Content Caching in Vehicular Edge Computing and Networks

TL;DR: Simulation results demonstrate that the proposed cooperative caching system can reduce the system cost, as well as the content delivery latency, and improve content hit ratio, as compared to the noncooperative and random edge caching schemes.
Journal ArticleDOI

A survey on predicting the popularity of web content

TL;DR: The different popularity prediction models are described, the features that have shown good predictive capabilities are presented, and factors known to influence web content popularity are revealed.
Journal ArticleDOI

Toward alternative metrics of journal impact: a comparison of download and citation data

TL;DR: Although social network metrics and ISI IF rankings deviate moderately for citation-based journal networks, they differ considerably for journal networks derived from download data, which raises questions regarding the validity of the ISI IF as the sole assessment of journal impact.
Proceedings ArticleDOI

Small-world file-sharing communities

TL;DR: In this article, the authors propose a new structure that captures common user interests in data, the data-sharing graph, and justify its utility with studies on three data-distribution systems: a high-energy physics collaboration, the Web and the Kazaa peer-to-peer network.
References
More filters
Proceedings Article

Cost-aware WWW proxy caching algorithms

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.
Related Papers (5)