LRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching

Authors:
Kai Cheng;Yahiko Kambayashi
Affiliations:
-;-
Venue:
COMPSAC '00 24th International Computer Software and Applications Conference
Year:
2000

Citing 6
Cited 9

Data cache management using frequency-based replacement

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Caching strategies to improve disk system performance

Computer
Caching on the World Wide Web

IEEE Transactions on Knowledge and Data Engineering
Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms

Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

A survey of Web cache replacement strategies

ACM Computing Surveys (CSUR)
Web caching: a way to improve web QoS

Journal of Computer Science and Technology
A collaborative approach for caching dynamic data in portal applications

ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Effectiveness of caching in a distributed digital library system

Journal of Systems Architecture: the EUROMICRO Journal
A quantitative study of recency and frequency based web cache replacement strategies

Proceedings of the 11th communications and networking simulation symposium
An admission-control technique for delay reduction in proxy caching

Decision Support Systems
Using data envelopment analysis to evaluate the efficiency of web caching object replacement strategies

Journal of Network and Computer Applications
A quantitative study of Web cache replacement strategies using simulation

Simulation
A novel dynamic cache size adjustment approach for better data retrieval performance over the internet

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents LRU-SP, a size-adjusted and popularity-aware extension to Least Recently Used (LRU) for caching web objects. The standard LRU, focusing on recently used and equal sized objects, is not suitable for the web context because web objects vary dramatically in size and the recently accessed objects may possibly differ from popular ones. LRU-SP is built on two LRU extensions, namely Size-Adjusted LRU and Segmented LRU. As LRU-SP differentiates object size and access frequency, it can achieve higher hit rates and byte hit rates. Furthermore, an efficient implementation scheme is developed and trace-driven simulations are performed to compare LRU-SP against Size-Adjusted LRU, Segmented LRU and LRV caching algorithms.