scispace - formally typeset
Journal ArticleDOI

A case for delay-conscious caching of Web documents

Reads0
Chats0
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
Book ChapterDOI

On the Optimal Placement of Web Proxies in the Internet: The Linear Topology

TL;DR: This paper investigates the optimal placement policy of web proxies for a target web server in the Internet, and obtains an optimal solution for a linear array topology using O(n 2 m) time.
Proceedings ArticleDOI

Soft caching: web cache management techniques for images

TL;DR: It is proposed that Soft Caching, where an image can be cached at one of a set of levels of resolutions, can benefit the overall performance when combined with cache management strategies that estimate, for each object, both the bandwidth to the server where the object is stored and the appropriate resolution level demanded by the user.
Journal ArticleDOI

WebCompanion: a friendly client-side Web prefetching agent

TL;DR: A client-side Java-implemented prefetching agent, WebCompanion, is built which employs a novel adaptive, fast, and selective onlinePrefetching strategy based on estimated round-trip times for Web resources, which efficiently hides the access latencies for slow resources while at the same time limiting the network and server overhead and local resource consumption to moderate levels.
Proceedings Article

{LHD}: Improving Cache Hit Rate by Maximizing Hit Density

TL;DR: This work introduces least hit density (LHD), a novel eviction policy for key-value caches that rigorously models objects’ behavior using conditional probability to adapt its behavior in real time and requires much less space than prior policies to match their hit rate.
Journal ArticleDOI

Market-based resource allocation for content delivery in the Internet

TL;DR: This work realistically model the agents in a CDN with selfish self-maximizing behaviors and defines the problem as a noncooperative game, and shows that the joint distribution and routing game has an equilibrium and demonstrates its performance by numerical examples.
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.