【24h】

Smallest Cache Utility algorithm based on Popularity

机译:基于流行度的最小缓存实用算法

获取原文

摘要

Streaming media is an important research direction in internet applications. In this paper, A Smallest Cache Utility algorithm based on Popularity in future (SCU-PK) is proposed. It comprehensively considered the merit of media time popularity and the smallest cache utility algorithm, using the entire file byte usefulness instead of the file segment bytes usefulness, so that a more effective byte usefulness calculation method and a more rational file segment popularity calculation method was designed and implement. The experiments show that the SCU-PK algorithm has better performance in increasing cache space utilization rate and byte hit ratio than LRU, LFU and SCU-PFUT in stream media proxy cache.
机译:流媒体是互联网应用中的重要研究方向。本文提出了一种基于普及(SCU-PK)的最小高速缓存实用算法。它综合地考虑了媒体时间普及和最小的高速缓存实用程序算法的优点,使用整个文件字节有用而不是文件段字节的有用性,从而设计了更有效的字节有用性计算方法和更合理的文件段受欢迎计算方法并实施。实验表明,SCU-PK算法在增加高速缓存空间利用率和字节命中比率时具有比LRU,LFU和SCU-PFUT在流媒体代理高速缓存中的高速度命中比率更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号