By Topic

An optimal cache replacement algorithm for Internet systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yeung, K.H. ; Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong ; Ng, K.W.

Cache replacement algorithms when applied in Internet systems are studied in this paper. The use of conventional replacement algorithms such as LRU and LFU is first discussed. We then present a new cache replacement algorithm called optimal cache replacement (OCR) algorithm for Internet systems. Analysis and simulation on OCR algorithm are performed. The results show that for small caches, OCR algorithm can outperform the conventional LFU algorithm by giving 50% improvement in cache hit rate. When the cache size is large, OCR algorithm still provides 18% improvement

Published in:

Local Computer Networks, 1997. Proceedings., 22nd Annual Conference on

Date of Conference:

2-5 Nov1997