Skip to main navigation Skip to search Skip to main content

Optimal cache replacement algorithm for Internet systems

  • K. H. Yeung
  • , K. W. Ng

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

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.
Original languageEnglish
Pages (from-to)189-194
JournalConference on Local Computer Networks
DOIs
Publication statusPublished - 1997
EventProceedings of the 1997 22nd Conference on Local Computer Networks, LCN - Minneapolis, MN, USA
Duration: 2 Nov 19975 Nov 1997

Fingerprint

Dive into the research topics of 'Optimal cache replacement algorithm for Internet systems'. Together they form a unique fingerprint.

Cite this