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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
