【24h】

Web Caching and Pre-fetching: A Data Mining Approach

机译:Web缓存和预取:一种数据挖掘方法

获取原文
获取原文并翻译 | 示例

摘要

With the increase in popularity of the Internet, the latency experienced by an individual, while accessing the web, is increasing. In this paper, we investigate one approach to reducing latency by increasing the hit rate for a web cache. To this effect, we developed a predictive model for pre-fetching and a modified Least Recently Used (LRU) method called AssocLRU. This paper investigates the application of a data mining technique, called Association rules to the web domain. The association rules, predict the URLs a user might reference next, and this knowledge is used in our web caching and pre-fetching model. We developed a trace driven cache simulator to compare the performance of our predictive model with the widely used replacement policy, namely, LRU. The traces we used in our experiments were the traces of Web proxy activity taken at Virginia Tech and EPA HTTP. Our results show that our predictive pre-fetching model using association rules achieves a better hit rate than both LRU and AssocLRU.
机译:随着Internet的普及,个人在访问Web时所经历的等待时间正在增加。在本文中,我们研究了一种通过增加Web缓存的命中率来减少延迟的方法。为此,我们开发了一种预取的预测模型和一种称为AssocLRU的改进的最近最少使用(LRU)方法。本文研究了一种称为关联规则的数据挖掘技术在Web域中的应用。关联规则,预测用户接下来可能引用的URL,并且此知识将在我们的Web缓存和预取模型中使用。我们开发了跟踪驱动的缓存模拟器,以将我们的预测模型的性能与广泛使用的替换策略(即LRU)进行比较。我们在实验中使用的痕迹是在Virginia Tech和EPA HTTP上进行的Web代理活动的痕迹。我们的结果表明,使用关联规则的预测性预取模型比LRU和AssocLRU都具有更高的命中率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号