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.
Get full access to this article
View all access options for this article.
