Journal ArticleDOI
A case for delay-conscious caching of Web documents
Peter Scheuermann,Junho Shim,Radek Vingralek +2 more
- Vol. 29, pp 997-1005
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 Article
An efficient cache replacement algorithm for multimedia object caching
TL;DR: This paper presents an optimal solution for calculating the minimal access cost of caching any number of versions of the same multimedia object and its extensive analysis, and proposes an efficient cache replacement algorithm for multimedia object caching.
Journal ArticleDOI
Performance optimization problem in speculative prefetching
TL;DR: A prefetch algorithm is developed based on finding the best solution to a stretch knapsack problem, using theoretically proven apparatus to reduce the search space and an integration between speculative prefetching and caching is investigated.
Proceedings ArticleDOI
A performance model of speculative prefetching in distributed information systems
TL;DR: An algorithm to maximise the improvement in access time by solving the stretch knapsack problem is developed, using theoretically proven apparatus to reduce the search space and a formula in terms of resource parameters and speculative parameters is derived.
Proceedings ArticleDOI
Coordinated caching in planet-scale CDNs: Analysis of feasibility and benefits
TL;DR: This paper analyzes the spatial correlation of video popularities worldwide, the effectiveness and feasibility of cache coordination, and its scalability: from a city to across countries.
Proceedings Article
On-path caching in information-centric networking
TL;DR: Simulation results show that the cache placement strategy is important in achieving good cache performance, and stand-alone caching strategies show limitations on their capability of reducing content download time.
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.