SzLFU(k) Web cache replacement algorithm

This paper proposes a Web cache replacement algorithm that considers object size and usage in its design. The algorithm is characterized by a parameter k, which is used as a criterion to select objects for replacement. We describe the algorithm and use an example to illustrate how it works. The algorithm has been implemented and applied to a variety of workloads which differ in the distribution of object size and access frequency. Experimental results are presented and analyzed. It is found that the method shows good performance compared to other existing schemes.