Abstract: The smallest cache utility algorithm based on popularity and visited times in future, SCU-PFUT, is proposed. In addition, it considers bytes benefit of stream media file and the size of file block, so it is more reasonable when move data block out of cache. It not only avoids the problem of the stream media file being continuously replaced, but also has better performance in enhancing cache hit rate, byte hit rate and space use rate than LRU, LFU and SCU-2.

Key words: stream media, proxy cache, cache replacement algorithm, popularity

摘要： 提出基于流行度和将来访问次数的最小效用替换算法(SCU-PFUT)，考虑流媒体文件的字节有效性和文件块大小等因素，使替换出内存的数据块更合理。避免LRU和LFU算法中出现的媒体文件被连续替换的问题，与LRU, LFU和SCU-2算法相比，该算法的缓存命中率、字节命中率和空间利用率较高。

关键词: 流媒体, 代理缓存, 缓存替换算法, 流行度

CLC Number: 

• TP391