Least Popularity-Per-Byte Replacement algorithm for a proxy cache

With the recent explosion in usage of the World Wide Web, the problem of caching Web objects has gained considerable importance. The performance of these Web caches is highly affected by the replacement algorithm. Today, many replacement algorithms have been proposed for Web caching and these algorithms use the on-line fashion parameters. Recent studies suggest that the correlation between the on-line fashion parameters and the object popularity in the proxy cache are weakening due to the efficient client caches. We suggest a new algorithm, called Least Popularity Per Byte Replacement (LPPB-R). We use the popularity value as the long-term measurements of request frequency to make up for the weak point of the previous algorithms in the proxy cache and vary the popularity value by changing the impact factor easily to adjust the peformance to needs of the proxy cache. We examine the performance of this and other replacement algorithms via trace driven simulation