arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.02889cs.PF
收藏

大型缓存系统中的最优内容复制和请求匹配

Optimal Content Replication and Request Matching in Large Caching Systems

Arpan Mukhopadhyay, Nidhi Hegde, Marc Lelarge

摘要:

我们考虑内容分发网络的模型,其中服务器受到两个主要资源的约束:内存和带宽。在这样的系统中,吞吐量关键取决于内容如何跨服务器复制,以及特定内容的请求如何与存储这些内容的服务器匹配。在本文中,我们首先制定的问题,计算最佳的复制策略,如果结合最佳的匹配策略,最大限度地提高吞吐量的缓存系统在固定制度。它表明,计算最佳的复制策略为一个给定的系统是一个NP-难问题。提出了一个贪婪复制方案,并证明了该方案提供了常数因子近似保证。然后,我们提出了一个简单的随机匹配方案,它避免了中断服务的正在进行的请求,由于重新分配或重新包装的现有请求的最佳匹配策略的问题。缓存系统的动态分析下,建议的复制和匹配方案的组合。我们研究了一个限制制度,服务器的数量和到达率的内容按比例缩放,并表明所提出的政策达到渐近最优。大量的仿真结果,以评估不同的策略的性能,并研究不同的服务时间分布的请求下的缓存系统的行为。

英文摘要:

We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth. In such systems, the throughput crucially depends on how contents are replicated across servers and how the requests of specific contents are matched to servers storing those contents. In this paper, we first formulate the problem of computing the optimal replication policy which if combined with the optimal matching policy maximizes the throughput of the caching system in the stationary regime. It is shown that computing the optimal replication policy for a given system is an NP-hard problem. A greedy replication scheme is proposed and it is shown that the scheme provides a constant factor approximation guarantee. We then propose a simple randomized matching scheme which avoids the problem of interruption in service of the ongoing requests due to re-assignment or repacking of the existing requests in the optimal matching policy. The dynamics of the caching system is analyzed under the combination of proposed replication and matching schemes. We study a limiting regime, where the number of servers and the arrival rates of the contents are scaled proportionally, and show that the proposed policies achieve asymptotic optimality. Extensive simulation results are presented to evaluate the performance of different policies and study the behavior of the caching system under different service time distributions of the requests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑