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.