arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.06752cs.ITmath.IT
收藏

组合网络中的缓存:利用网络拓扑结构的新型组播消息生成与传递

Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology

Kai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti

摘要:

Maddah-Ali和Niesen的原始编码缓存方案用于共享链路广播网络,现在已知其在因子2内是最优的,并且已被应用于其他类型的网络。出于实际原因,本文认为,服务器通过$H$中间中继与缓存辅助用户进行通信。特别地,它集中于组合网络,其中每个$K = \binom{H}{r}$用户连接到不同的$r$ -中继子集。利用网络的对称拓扑结构,本文提出了一种新的方法来通用的组播消息,并将其发送给用户。通过数值计算,所提出的方案被证明可以减少下载时间相比,在文献中可用的计划。然后,这个想法扩展到分散组合网络,更一般的中继网络,并与缓存辅助继电器和用户的组合网络。此外,在这些情况下,所提出的方案优于已知的。

英文摘要:

Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a server communicates to cache-aided users through $H$ intermediate relays. In particular, it focuses on combination networks where each of the $K = \binom{H}{r}$ users is connected to a distinct $r$-subsets of relays. By leveraging the symmetric topology of the network, this paper proposes a novel method to general multicast messages and to deliver them to the users. By numerical evaluations, the proposed scheme is shown to reduce the download time compared to the schemes available in the literature. The idea is then extended to decentralized combination networks, more general relay networks, and combination networks with cache-aided relays and users. Also in these cases the proposed scheme outperforms known ones.

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

↑