基于协同过滤的Web缓存替换算法研究  

A web cache replacement algorithm based on collaborative filtering

作　　者：吴俊龙[1] 杨清[1] 

机构地区：[1]湖南科技大学计算机科学与工程学院,湖南湘潭411201

出　　处：《计算机工程与科学》2015年第11期2128-2133,共6页Computer Engineering & Science

基　　金：湖南省科技计划资助项目(2013FJ4050)

摘　　要：针对GDSF替换算法中对访问频率缺少预测的不足,提出了一种基于协同过滤的GDSF缓存替换算法(GDSF-CF)。该算法考虑了Web对象之间相似性与用户访问时间间隔,运用协同过滤算法生成Web对象的预测访问频率,并采用齐普夫定律参数对GDSF算法的目标函数进行了改进。当需要进行缓存替换时,利用目标函数价值计算缓存空间中的每个Web对象缓存价值,将最小缓存价值的Web对象进行替换。仿真实验结果表明,该算法的命中率HR和字节命中率BHR都有较大提升。To address the shortcoming that the GDSF replacement algorithm cannot predict visit fre- quency, 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 collabo- rative 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 ob- ject, and the web object with the minimum value will be replaced in the first place. Simulation experi- ments show that the GDSF-CF algorithm has a higher hit rate and byte hit rate.

关 键 词：WEB缓存 协同过滤 替换算法 

分 类 号：TP393.027.3[自动化与计算机技术—计算机应用技术]