基于最小效用的流媒体缓存替换算法

提出最小缓存替换算法SCU-K，综合考虑流媒体文件最近K次访问情况，使缓存大小动态适应媒体流行度、字节有用性和已缓存部分大小的变化，降低了文件前缀部分被替换的概率，避免LRU和LFU算法中出现的媒体文件被连续替换的问题。在与LRU，LFU和LRU-2算法的对比实验中，SCU-K算法在提高缓存空间利用率、字节命中率和降低启动延迟方面具有更好的性能。

Proxy cache replacement algorithms for streaming media based on smallest cache utility

The Smallest Cache Utility-K (SCU-K) algorithm was proposed. It comprehensively considered the latest K times of visits in order to make the cached size dynamically adapt to the change of the media popularity, bytes benefit and the size of cached parts. In such cases, the probability of the file's prefix part being replaced was reduced and such problem of the LRU and LFU algorithm as the streaming media file being continuously replaced and finally being released was avoided. The experiment proves that the SCU-K algorithm has better performance in increasing cache space utilization rate and byte hit ratio, and reducing startup delay than LRU, LFU and LRU-2.