一种基于类Zipf法则的多媒体服务器缓存排序替换策略
A Rank Based Replacement Policy for Multimedia Server Cache Using Zipf-Like Law
摘要：
缓存替换算法对代理服务器系统的整体性能起着重要的作用。在本文中，我们提出了视频点播的多媒体服务器系统的缓存替换算法。我们提出了一个基于秩的缓存替换策略来管理单个代理服务器缓存中的缓存空间。建议的替换策略采用了一种简单的方式，最重要的特点，视频和它的访问，如它的大小，访问频率，最近的最后一次访问和所产生的成本，而所请求的视频从服务器传输到代理。我们比较了我们的算法与一些流行的缓存替换算法使用模拟。通过考虑大小、频率和成本等因素，基于访问趋势对视频对象进行排序。许多研究表明，Zipf定律可以控制视频点播的许多特征，并用于描述视频的受欢迎程度。在本文中，我们设计了一个模型，它排名的视频的基础上，它的流行性，使用Zipf的法律。具有较高排名的视频被命名为“热”，而具有较低排名的视频被命名为“冷”。实验结果表明，与其他算法相比，该算法提高了缓存命中率、缓存字节率和平均请求延迟。实验结果表明，基于秩的缓存替换算法的性能优于LRU、LFU和Greedy Dual。
英文摘要：
The cache replacement algorithm plays an important role in the overall performance of Proxy-Server system. In this paper we have proposed VoD cache memory replacement algorithm for a multimedia server system. We propose a Rank based cache replacement policy to manage the cache space in individual proxy server cache. Proposed replacement strategy incorporates in a simple way the most important characteristics of the video and its accesses such as its size, access frequency, recentness of the last access and the cost incurred while transferring the requested video from the server to the proxy. We compare our algorithm with some popular cache replacement algorithm using simulation. The video objects are ranked based on the access trend by considering the factors such as size, frequency and cost. Many studies have demonstrated that Zipf's-like law can govern many features of the VoD and is used to describe the popularity of the video. In this paper, we have designed a model, which ranks the video on the basis of its popularity using the Zipf-like law. The video with higher ranking is named "hot", while the video with lower ranking is named "cold". The result show that the proposed rank based algorithm improves cache hit ratio, cache byte ratio and average request latencies compared to other algorithms. Our experimental results indicate that Rank based cache replacement algorithm outperforms LRU, LFU and Greedy Dual.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
