An improved Greedy Dual* cache document replacement algorithm

Keqiu Li, Hong Shen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004
EditorsN. Zhong, H. Tirri, Y. Yao, L. Zhou
Pages457-460
Number of pages4
Publication statusPublished - 2004
Externally publishedYes
EventProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 - Beijing, China
Duration: 20 Sept 200424 Sept 2004

Publication series

NameProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004

Conference

ConferenceProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004
Country/TerritoryChina
CityBeijing
Period20/09/0424/09/04

Keywords

  • Algorithm
  • Cache replacement
  • GreedyDual*
  • Simulation
  • Web caching

Fingerprint

Dive into the research topics of 'An improved Greedy Dual* cache document replacement algorithm'. Together they form a unique fingerprint.

Cite this