基于预测的Web缓存替换算法  

Web cache replacement algorithm based on prediction

作　　者：韩向春[1] 田玉根[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《计算机工程与设计》2010年第1期110-113,共4页Computer Engineering and Design

摘　　要：为了提高Web缓存的性能,在缓存替换算法GDSF的基础上引入了预测机制,提出了基于预测的缓存替换算法PGDSF。先利用Web日志构造预测模型,再用预测模型对当前的用户访问序列进行预测,形成用户可能要访问的预测对象集。当缓存空间不能满足新请求对像时,则利用替换策略GDSF,将权值最小的且不属于预测对象集的对像进行替换。该算法综合考虑了各项因素对Web对象的影响,仿真实验结果表明,在一定的缓存空间内相对于GDSF替换算法有较高的文档命中率和字节命中率。To improve the performance of web cache, a new cache replacement algorithm named PGDSF is proposed, which is based on the GDSF algorithm and joined the prediction mechanism. Firstly, the web log is used to construct prediction model, then prediction model is forcasted and current user access sequence topredict the target set of the prediction is formed. When the cache had not enough space to accommodate new requests, to replace the key which is the smallest key of GDSF and does not belong to the target set of pre- diction. The PGDSF algorithm takes into account factors of the target of web. The simulation shows that the current algorithm have higher percentage of hit rate and byte hit rate than the GDSF replacement algorithm in the certain cache space.

关 键 词：预测 WEB缓存 替换策略 预测模型 WEB日志 

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