论文标题
与组合拓扑的多访问编码缓存的确切负载内存权衡
The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology
论文作者
论文摘要
最近，Muralidhar等人。提出了一个新型的多访问系统模型，其中每个用户都以遵循众所周知的组合网络组合拓扑结合的方式连接到多个缓存。对于此类多访问拓扑，同一位作者提出了一个可实现的方案，即使使用非常适中的缓存资源，它也为前所未有的编码增长而脱颖而出。在本文中，我们确定了具有非凡潜力的多访问设置的基本限制，提供了一种信息理论匡威，该信息与Muralidhar等人的内部结合在一起，这是未经编码的预取料中确切的最佳性能。
Recently, Muralidhar et al. proposed a novel multi-access system model where each user is connected to multiple caches in a manner that follows the well-known combinatorial topology of combination networks. For such multi-access topology, the same authors proposed an achievable scheme, which stands out for the unprecedented coding gains even with very modest cache resources. In this paper, we identify the fundamental limits of such multi-access setting with exceptional potential, providing an information-theoretic converse which establishes, together with the inner bound by Muralidhar et al., the exact optimal performance under uncoded prefetching.
