Web caching and Zipf-like distributions: evidence and implications

@article{Breslau1999WebCA,
  title={Web caching and Zipf-like distributions: evidence and implications},
  author={Lee Breslau and Pei Cao and Li Fan and Graham Phillips and Scott Shenker},
  journal={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)},
  year={1999},
  volume={1},
  pages={126-134 vol.1}
}
  • L. BreslauP. Cao S. Shenker
  • Published 21 March 1999
  • Computer Science
  • 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)
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… 

Figures and Tables from this paper

Exploitation of different types of locality for Web caches

It is argued that there exist cache replacement algorithms that combine these characteristics and achieve high performance at a low cost and the Window-LFU is described, a policy that combines LFU and LRU and achieves better performance than LFU at lower cost.

Web caching and content distribution: a view from the interior

Effective caching of Web objects using Zipf's law

  • D. SerpanosGeorge KarakostasM. Wolf
  • Computer Science
    2000 IEEE International Conference on Multimedia and Expo. ICME2000. Proceedings. Latest Advances in the Fast Changing World of Multimedia (Cat. No.00TH8532)
  • 2000
This paper provides an analysis using Chernoff's bound and a calculation of an upper bound of the number of initial requests that need to be processed in order to obtain measurements of popularity with high confidence and a measured Zipf distribution which converges to the correct one.

An overview of web caching replacement algorithms

It is argued that a good caching policy adapts itself to changes in Web workload characteristics, and makes a qualitative comparison between these policies after classifying them according to the traffic properties they consider in their designs.

The Electronic Magazine of Original Peer-Reviewed Survey Articles

It is argued that a good caching policy adapts itself to changes in Web workload characteristics, and makes a qualitative comparison between these policies after classifying them according to the traffic properties they consider in their designs.

On filter effects in web caching hierarchies

The simulation results demonstrate that size-based partitioning and heterogeneous cache replacement policies each offer improvements in overall caching performance, and considers novel cache management techniques that can better exploit the changing workload characteristics across a multilevel Web proxy caching hierarchy.

Workload Characterization of a Personalized Web Site — And Its Implications for Dynamic Content Caching

This study studies the characteristics of a medium-sized personalized web site, NYUHome, which is a customizable portal used by approximately 44,000 users from the New York University community, and verifies both the need for and likely benefit from caching content at sub-document granularity, and points to additional opportunities for reducing client-perceived latency using prefetching, access prediction, and content transcoding.

Adaptive Web Proxy Caching Algorithms

This paper analyzes the distribution of current web content and re-evaluates various proxy cache replacement algorithms including LFU, LRU and several GreedyDual variants and proposes two new web caching algorithms: a local policy that maintains a list of popular URLs and a global policy that partitions the cache into distinct regions.
...

References

SHOWING 1-10 OF 41 REFERENCES

The Measured Access Characteristics of World-Wide-Web Client Proxy Caches

An analysis of access traces collected from seven proxy servers deployed in various locations throughout the Internet shows that a 2- to 10-GB second-level cache yields hit rates between 24% and 45% with 85% of these hits due to sharing among different clients.

Replacement policies for a proxy cache

This paper proposes a novel replacement policy, called LRV, which selects for replacement the document with the lowest relative value among those in cache, and shows how LRV outperforms least recently used (LRU) and other policies and can significantly improve the performance of the cache, especially for a small one.

Characterizing reference locality in the WWW

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.

Characteristics of WWW Client-based Traces

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.

Exploring the Bounds of Web Latency Reduction from Caching and Prefetching

It is concluded that for the workload studied caching offers moderate assistance in reducing latency and prefetching can offer more than twice the improvement of caching but is still limited in its ability to reduce latency.

World Wide Web Cache Consistency

Using trace-driven simulation, it is shown that a weak cache consistency protocol (the one used in the Alex ftp cache) reduces network bandwidth consumption and server load more than either time-to-live fields or an invalidation protocol and can be tuned to return stale data less than 5% of the time.

Cost-Aware WWW Proxy Caching Algorithms

  • P. CaoS. Irani
  • Computer Science
    USENIX Symposium on Internet Technologies and Systems
  • 1997
Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through cost-aware caching. This paper introduces

System Design Issues for Internet Middleware Services: Deductions from a Large Client Trace

The heterogeneity of web clients, the existence of a strong and very predictable diurnal cycle in the clients' web activity, the burstiness of clients' requests at small time scales, the presence of locality of reference in the client's requests that is a strong function of the client population size, and the high latency that services encounter when delivering data to clients are demonstrated.

A Caching Relay for the World Wide Web

  • S. Glassman
  • Computer Science
    Comput. Networks ISDN Syst.
  • 1994