Cache Replacement Improving Based on User Group Interest Degree

In order to reduce access latency and improve user experience, the current schemes include cache and prefetching technologies. The current cache replacement schemes only consider access time and access frequency, but ignore the user-group interest degree in access paths. This paper studies the visiting characteristics of user groups. Then a cache replacement improving algorithm is put forward called P-GDSF, which is based on the GDSF algorithm and joined the prediction mechanism due to user-group interest degree. The new algorithm takes most factors of Web objects into account. The simulation shows that our algorithm can achieve relatively higher hit rate and byte hit rate than the GDSF replacement algorithm in a certain cache space.