Web Proxy Caching Scheme Based on Multilist Structure Mixed Policies

摘要

The Web is growing rapidly and revolutionizing the means of information access. Web caches are different from processor caches because web caches have several additional criteria, such as frequency and recentness of pages, size of a document, cost of fetching a document etc. It has been shown that, the classical LRU replacement policy performs poorly in Web caches because the above criteria decrease hit rate and increase eviction latency and access latency of Web request. In this paper, in order to improve proxy's speed and hit rate, a three-class-list structure is used to organize the index of html elements in cache. It gives a lifetime-cycle algorithm and out-of-date replacing policies for web cache replacement, which based on a mixed policies including LFU, LRU, long term static element factor and network bandwidth factor. Experimental results show that three-class-listing structure to perform the mixed replacement policies and out-of-date factors, the pages hit rates arrive at 50% when cache size is about 500M, which has a fast step compared by 3.7% in traditional LRU-based ones.