An improved Greedy Dual* cache document replacement algorithm

Keqiu Li; Hong Shen

doi:10.1109/WI.2004.10052

An improved Greedy Dual* cache document replacement algorithm

Keqiu Li
, Hong Shen

Japan Advanced Institute of Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004
Publisher	IEEE Computer Society
Pages	457-460
Number of pages	4
ISBN (Print)	0769521002, 9780769521008
DOIs	https://doi.org/10.1109/WI.2004.10052
Publication status	Published - 2004
Externally published	Yes
Event	3rd IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 - Beijing, China Duration: 20 Sept 2004 → 24 Sept 2004

Publication series

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

Conference

Conference	3rd IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004
Country/Territory	China
City	Beijing
Period	20/09/04 → 24/09/04

Keywords

Algorithm
Cache replacement
GreedyDual*
Simulation
Web caching

Access to Document

10.1109/WI.2004.10052

Cite this

@inproceedings{c3285db5751a44888cd6a2f350ddfba4,

title = "An improved Greedy Dual* cache document replacement algorithm",

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.",

keywords = "Algorithm, Cache replacement, GreedyDual*, Simulation, Web caching",

author = "Keqiu Li and Hong Shen",

year = "2004",

doi = "10.1109/WI.2004.10052",

language = "English",

isbn = "0769521002",

series = "Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004",

publisher = "IEEE Computer Society",

pages = "457--460",

booktitle = "Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004",

address = "United States",

note = "3rd IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 ; Conference date: 20-09-2004 Through 24-09-2004",

}

Li, K & Shen, H 2004, An improved Greedy Dual* cache document replacement algorithm. in Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004. Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004, IEEE Computer Society, pp. 457-460, 3rd IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004, Beijing, China, 20/09/04. https://doi.org/10.1109/WI.2004.10052

An improved Greedy Dual* cache document replacement algorithm. / Li, Keqiu; Shen, Hong.
Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004. IEEE Computer Society, 2004. p. 457-460 (Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An improved Greedy Dual* cache document replacement algorithm

AU - Li, Keqiu

AU - Shen, Hong

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Algorithm

KW - Cache replacement

KW - GreedyDual

KW - Simulation

KW - Web caching

UR - https://www.scopus.com/pages/publications/15544386819

U2 - 10.1109/WI.2004.10052

DO - 10.1109/WI.2004.10052

M3 - Conference contribution

AN - SCOPUS:15544386819

SN - 0769521002

SN - 9780769521008

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

SP - 457

EP - 460

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

PB - IEEE Computer Society

T2 - 3rd IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004

Y2 - 20 September 2004 through 24 September 2004

ER -

An improved Greedy Dual* cache document replacement algorithm

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this