计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 77-79.doi: 10.3969/j.issn.1000-3428.2010.06.025

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

基于背包理论的流媒体缓存算法

石晓星1,石 磊1,卫 琳2   

  1. (1. 郑州大学信息工程学院,郑州 450001;2. 郑州大学软件技术学院,郑州 450002)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Streaming Media Cache Algorithm Based on Knapsack Theory

SHI Xiao-xing1, SHI Lei1, WEI Lin2   

  1. (1. School of Information Engineering, Zhengzhou University, Zhengzhou 450001;2. School of Software Technology, Zhengzhou University, Zhengzhou 450002)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

摘要: 为了使缓存总体效益最大化,基于字节命中率,利用0-1背包对代理缓存建立模型,给出流媒体缓存替换算法。实验结果表明,与传统流媒体缓存算法相比,该算法能减少占用带宽,提升缓存写入效率,具有较高的字节命中率。

关键词: 流媒体缓存, 字节命中率, 背包, 替换策略

Abstract: In order to make total benefit maximize for cache, based on byte hit ratio, this paper gives streaming media cache replacement algorithm by using 0-1 knapsack to set up a proxy cache model. Experimental result shows that this algorithm can reduce occupied bandwidth, enhance cache read-in efficiency, and it has a higher hit ratio.

Key words: streaming media cache, byte hit ratio, knapsack, replacement policy

中图分类号: