Abstract
In this paper, the adaptive replacement policy and the pre-fetching technique for Web caching systems are studied with two user request models and their combinations. Performance results from two most commonly used replacement policies: LRU (Least Recently Used) and LFU (Least Frequently Used) are compared. It is shown that LRU performs better for one of the user request models and LFU is on the opposite. The adaptive replacement policy is intelligent in finding the best candidate policy as the user access pattern changes. The learning speed of the system is tested by different switch thresholds.
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 callMore From: Journal of Computational Methods in Sciences and Engineering
Disclaimer: 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.
