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
Journal ArticleDOI

Self-tuning caching: the Universal Caching algorithm

TL;DR: Using a self‐tuning mechanism, combined with a generalization of the criteria employed in GD‐* Web caching, Universal Caching was able to consistently outperform any other fixed choice of algorithm the authors tested.
Journal ArticleDOI

Replicated servers allocation for multiple information sources in a distributed environment

TL;DR: This paper investigates the server replication in a controlled distributed environment, considers the problem of placing multiple replicated servers within a network, given there exist multiple target web servers as information providers, and presents a number of heuristics-based algorithms for server replications.
Book ChapterDOI

Cache Design for Transcoding Proxy Caching

TL;DR: Wang et al. as mentioned in this paper proposed an original cache maintenance algorithm, which integrates both cache replacement and consistence algorithms, and formulated a generalized cost saving function to evaluate the profit of caching a multimedia object.
Proceedings ArticleDOI

A Minimal Access Cost-Based Multimedia Object Replacement Algorithm

TL;DR: This paper presents an optimal solution for calculating the minimal access cost of caching multiple versions of the same multimedia object, and proposes an effective cache replacement algorithm for multimedia object caching.
Journal Article

Cache design for transcoding proxy caching

TL;DR: This paper proposes an original cache maintenance algorithm, which integrates both cache replacement and consistence algorithms, and explicitly reveals the new emerging factors in the transcoding proxy.
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.