|
Abstract : |
In this paper we analyze Web access traces to a proxy, in order to derive useful information for the development of a good replacement policy for documents held in the cache. The analysis reveals a number of interesting properties on the lifetime and statistics of access to documents, which are discussed in this paper. These properties show why LRU works reasonably well but can be improved. We propose a simple policy called LRV which selects for replacement the document with the Lowest Relative Value among those in cache. The value of a document is computed basing on information readily available to the proxy server, and the computations associated with the replacement policy requires only a small constant time. We show how LRV outperforms LRU and other policies, and can significantly improve the performance of the cache. 1, |
