Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache

Authors:
Affiliations:
Venue:
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Year:
2001

Citing 0
Cited 4

Web caching: a way to improve web QoS

Journal of Computer Science and Technology
Anycast-Based Cooperative Proxy Caching: Preliminary Results

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Anycast-based cooperative proxy caching

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
From web cache to cloud cache

GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: 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 But, 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. In this paper, 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 performance to needs of the proxy cache. And we examine the performance of this and other replacement algorithm via trace driven simulation.