作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (8): 85-87. doi: 10.3969/j.issn.1000-3428.2009.08.029

• 软件技术与数据库 • 上一篇    下一篇

Web缓存优化模型研究

张 艳1,2,石 磊1,2,卫 琳1,3   

  1. (1. 河南省信息网络重点开放实验室,郑州 450052;2. 郑州大学信息工程学院,郑州 450001;3. 郑州大学升达经贸管理学院,郑州 451191)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-20 发布日期:2009-04-20

Study on Optimal Model of Web Cache

ZHANG Yan1,2, SHI Lei1,2, WEI Lin1,3   

  1. (1. Henan Provincial Key Lab of Information Network, Zhengzhou 450052; 2. School of Information Engineering, Zhengzhou University, Zhengzhou 450001; 3. Shengda Economics Trade and Management College, Zhengzhou University, Zhengzhou 451191)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-20 Published:2009-04-20

摘要: 缓存模型研究的核心是替换策略的优化。分析并比较传统缓存模型IRM和MRM的思想,基于相对流行度以及字节代价的概念,提出满足命中率、字节命中率和延迟时间等不同性能指标要求的Web缓存优化模型,并给出相应算法。实验及分析表明,Web缓存优化模型替换算法的性能表现较传统算法有所提高。

关键词: Web缓存模型, 缓存替换算法, Zipf定律, 优化模型

Abstract: Replacement algorithm optimization is the core of cache model research. Independent Reference Model(IRM) and Markov Reference Model(MRM) are analyzed and compared in this paper. Based on the measurement of relative popularity and Byte cost, optimal Web cache model and corresponding algorithm are presented that satisfy different performance metrics. Simulations and analysis show that optimal algorithm outperforms the existed Web cache replacement algorithms in corresponding performance.

Key words: Web cache model, cache replacement algorithm, Zipf law, optimal model

中图分类号: