An Improved GreedyDual Cache Document Replacement Algorithm

Authors:
Keqiu Li;Hong Shen
Affiliations:
Japan Advanced Institute of Science and Technology;Japan Advanced Institute of Science and Technology
Venue:
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Year:
2004

Citing 6
Cited 0

Generating representative Web workloads for network and server performance evaluation

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A survey of web caching schemes for the Internet

ACM SIGCOMM Computer Communication Review
Caching on the World Wide Web

IEEE Transactions on Knowledge and Data Engineering
Sources and Characteristics of Web Temporal Locality

MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
An Overview of Data Replication on the Internet

ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Modeling Internet topology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Web caching is an important technique for reducing web traffic, user access latency, and server load and cache replacement plays an important role in the functionality of web caching. In this paper we propose an improved GreedyDual (GD) cache document replacement algorithm, which considers update frequency as a factor in its utility function. We use both trace data and statistical data to simulate our proposed algorithm. The experimental results show that our improved GD algorithm can outperform the existing GD algorithm over the performance metrics considered.