【24h】

Web Cache Prefetching by Multi-dimensional Matrix

机译:多维矩阵的Web缓存预取

获取原文

摘要

In this paper, we study Web cache prefetching with multiple web pages. Four multi-prefetching models including the Top-m, Future-r, (Top-m)+(Future-r) and multi-dimensional matrix are introduced. The idea is based on examination of the probabilities on sequence request patterns. Simulation results on hit rate comparison are also presented. The algorithms generalize the previous work of two-dimensional probability matrix in the application of Web cache prefetching.
机译:在本文中,我们使用多个网页研究Web缓存预取。介绍了四种多预取模型,包括TOP-M,未来R,(TOP-M)+(未来-R)和多维矩阵。该想法是基于对序列请求模式的概率进行检查。还提出了仿真结果对比较的结果。算法在应用Web高速缓存预取的应用中概括了二维概率矩阵的先前工作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号