The persistent-access-caching algorithm

ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching systems is designing document placement/replacement algorithms for updating the collection of cached documents. The main design objectives of such a policy are the high cache hit ratio, ease of implementation, low complexity and adaptability to the fluctuations in access patterns. These objectives are essentially satisfied by the widely used heuristic called the least-recently-used (LRU) cache replacement rule. However, in the context of the independent reference model, the LRU policy can significantly underperform the optimal least-frequently-used (LFU) algorithm that, on the other hand, has higher implementation complexity and lower adaptability to changes in access frequencies. To alleviate this problem, we introduce a new LRU-based rule, termed the persistent-accesscaching (PAC), which essentially preserves al...

• Type: Journal
• Year: 2008
• Where: RSA
• Authors: Predrag R. Jelenkovic, Ana Radovanovic
• Keywords: Algorithm, Cache, Independent Reference Model, RSA 2008