Journal ArticleDOI
A case for delay-conscious caching of Web documents
Peter Scheuermann,Junho Shim,Radek Vingralek +2 more
- Vol. 29, pp 997-1005
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
Evicting SDDS-2000 Buckets in RAM to the Disk (Extended Abstract)
W. Litwin,P. Scheuermann +1 more
TL;DR: This work proposes to investigate three possible solutions for the cache replacement algorithm that attempts to minimize the total throughput of the SDDS server.
Book ChapterDOI
Using a Light-Weighted Cache Pool to Leverage the Performance of Web Picture Databases
Chao Li,Chunxiao Xing,Lizhu Zhou +2 more
TL;DR: This paper implements a light-weighted cache pool which is very effective in improving picture access performance by utilizing the characteristics of “hotspot” and caching “hot” data in a pool.
Book ChapterDOI
An Efficient Web Caching Replacement Algorithm
TL;DR: In this article, a new improved cache profit model is defined, and the validation and freshness factors of Web pages have been taken into adequate account, and a new caching replacement algorithm-EWCR (Efficient Web Caching Replacement) is proposed, and it is proved to be optimal based on reasonable assumptions.
Proceedings ArticleDOI
Efficient Distance based Response Time Pruning Cache Policy for NDN
TL;DR: In this paper , the authors proposed an NDN-based cache strategy that can increase network efficiency by employing a caching function at the intermediate nodes of the network to enhance network efficiency, which minimizes network response time and increases the network cache hit ratio.
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.