An optimal cache replacement algorithm for Internet systems

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.