摘要: 缓存模型研究的核心是替换策略的优化。分析并比较传统缓存模型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
中图分类号:
张 艳;石 磊;卫 琳;. Web缓存优化模型研究[J]. 计算机工程, 2009, 35(8): 85-87.
ZHANG Yan; SHI Lei; WEI Lin;. Study on Optimal Model of Web Cache[J]. Computer Engineering, 2009, 35(8): 85-87.