Updating Content in Cache-Aided Coded Multicast
Updating Content in Cache-Aided Coded Multicast
复制标题
DOI：
10.1109/jsac.2018.2844943
复制
发表时间：
2018-05
影响因子：
16.4
通讯作者：
M. Mahdian;N. Prakash;M. Médard;E. Yeh
中科院分区：
文献类型：
--
作者：
M. Mahdian;N. Prakash;M. Médard;E. Yeh
在内容分发网络和分布式文件共享系统等环境中，应用程序需要提供动态更新但相关的数据，因此我们研究了缓存辅助网络中的单源多目标网络编码多播问题。我们主要关注缓存主要位于目标附近且源没有缓存的模型。源代码观察相关帧的序列，并期望逐帧编码，而不访问先前的帧。我们提出了一种新颖的方案，该方案展示了如何有利地使用缓存来降低多播的总体成本，即使源编码没有访问过去的数据。我们的缓存设计和更新方案适用于为相应的无缓存网络设计的任何网络代码，在很大程度上是分散的，并且适用于任意网络。我们研究了由总代价函数引起的最优化问题的一个凸关系。优化问题的结果决定了速率分配和缓存策略。大量的仿真结果证实了所提出的理论。
Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast problem in a cache-aided network. We focus on models where the caches are primarily located near the destinations and the source has no cache. The source observes a sequence of correlated frames and is expected to do frame-by-frame encoding with no access to prior frames. We present a novel scheme that shows how the caches can be advantageously used to decrease the overall cost of multicast, even though the source encodes without access to past data. Our cache design and update scheme works with any choice of network code designed for a corresponding cache-less network, is largely decentralized, and works for an arbitrary network. We study a convex relation of the optimization problem that results from the overall cost function. The results of the optimization problem determine the rate allocation and caching strategies. Numerous simulation results are presented to substantiate the theory developed.