scispace - formally typeset
Journal ArticleDOI

A case for delay-conscious caching of Web documents

TLDR
This paper presents a new, delay-conscious cache replacement algorithm LNC-R-W3 which maximizes a performance metric called delay-savings-ratio and compares it with other existing cache replacement algorithms, namely LRU and LRU-MIN.
Abstract
Caching at proxy servers plays an important role in reducing the latency of the user response, the network delays and the load on Web servers. The cache performance depends critically on the design of the cache replacement algorithm. Unfortunately, most cache replacement algorithms ignore the Web's scale. In this paper we argue for the design of delay-conscious cache replacement algorithms which explicitly consider the Web's scale by preferentially caching documents which require a long time to fetch to the cache. We present a new, delay-conscious cache replacement algorithm LNC-R-W3 which maximizes a performance metric called delay-savings-ratio. Subsequently, we test the performance of LNC-R-W3 experimentally and compare it with the performance of other existing cache replacement algorithms, namely LRU and LRU-MIN.

read more

Citations
More filters

On Caching Search Engine Results

TL;DR: Using trace-driven simulation, it is demonstrated that medium-size caches can hold the results of most of the the frequently-submitted queries and the effectiveness of static and dynamic caching is concluded that static caching is very effective particularly for small caches, like main memory caches.
Journal ArticleDOI

Flexible Caching Algorithms for Video Content Distribution Networks

TL;DR: This work designs multiple algorithms for content caching on the servers of global video CDNs: a LRU-based baseline to address the requirements; a flexible ingress-efficient algorithm; an offline cache aware of future requests (greedy); an optimal offline cache (for limited scales); and an adaptive ingress control algorithm for reducing the server’s peak upstream traffic.
Journal ArticleDOI

Web-conscious storage management for Web proxies

TL;DR: This paper proposes Web-Conscious Storage Management, a set of techniques that exploit the unique reference characteristics of web-page accesses in order to allow web proxies to overcome file I/O limitations, and shows that these techniques can improve the proxy's secondary storage I/o throughput by a factor of 15 over traditional open-source proxies.
Journal ArticleDOI

Performance models of a firm's proxy cache server

TL;DR: A “crossover probability” is identified, the minimum cache “hit rate” probability at which installing a proxy cache server (PCS) becomes beneficial, which decreases as the arrival rate of Web requests or the average file size increases.
Journal ArticleDOI

An adaptive semantics-aware replacement algorithm for web caching

TL;DR: This paper proposes a new solution that adds a spatial dimension to the cache replacement process, called SACS, which measures the distance between objects in terms of the number of links necessary to navigate from one object to another.
References
More filters
Proceedings ArticleDOI

The LRU-K page replacement algorithm for database disk buffering

TL;DR: The LRU-K algorithm surpasses conventional buffering algorithms in discriminating between frequently and infrequently referenced pages, and adapts in real time to changing patterns of access.
ReportDOI

A hierarchical internet object cache

TL;DR: The design and performance of a hierarchical proxy-cache designed to make Internet information systems scale better are discussed, and performance measurements indicate that hierarchy does not measurably increase access latency.
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.

Caching Proxies: Limitations and Potentials

TL;DR: This work assesses the potential of proxy servers to cache documents retrieved with the HTTP protocol, and finds that a proxy server really functions as a second level cache, and its hit rate may tend to decline with time after initial loading given a more or less constant set of users.
Related Papers (5)
Trending Questions (1)
How to clear browser cache in Robot Framework?

In this paper we argue for the design of delay-conscious cache replacement algorithms which explicitly consider the Web's scale by preferentially caching documents which require a long time to fetch to the cache.