Abstract:

To address the shortcoming that the GDSF replacement algorithm cannot predict visit frequency, we propose a collaborative filtering based GDSF web cache replacement algorithm (GDSFCF). Considering the similarities among web objects and the time interval of users’ visits, we use the collaborative filtering technology to generate the predicted visit frequency of each web object, and adopts Zipflike parameters to modify the objective functions of the GDSF algorithm. When cache replacement is performed, the value of the objective functions are used to calculate the caching value of each web object, and the web object with the minimum value will be replaced in the first place. Simulation experiments show that the GDSF-CF algorithm has a higher hit rate and byte hit rate.

Key words: Web cache;collaborative filtering;replacement algorithm