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
A Scalable Efficient Robust Adaptive (SERA) Architecture for the Next Generation of Web Service
TL;DR: A piggybacked prefetching/pre-resolving scheme, which uses user access pattern and network environment information, and an efficient cache routing scheme is employed to assist the cache resolution.
Proceedings ArticleDOI
DWCS: A Dynamic Web Cache Selection algorithm
TL;DR: A new cache benefit model is defined, an algorithm - DWCS (Dynamic Web Cache Selection) is presented, and it is proved to be optimal under the reasonable hypothesis, and the experimental results show the efficiency of DWCS algorithm.
Journal ArticleDOI
CRRP: Cost-Based Replacement with Random Placement for En-Route Caching
Sen Wang,Jun Bi,Jianping Wu +2 more
TL;DR: A new caching scheme with cost-based replacement and random placement, which is named CRRP is proposed, which outperforms a wide range of caching schemes and is very close to the traditional dynamic-programming-based algorithm, in terms of average access delay.
Proceedings ArticleDOI
Coordinated en-route transcoding caching for tree networks
TL;DR: This paper proposes a model for transcoding proxy placement for coordinated en-route Web caching for tree networks by considering all the nodes among the network in a coordinated way and formulate this problem as an optimization problem.
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.