The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology

TL;DR

This paper determines the fundamental limits of multi-access coded caching with combinatorial topology, establishing the exact optimal performance under uncoded prefetching through an information-theoretic converse.

Contribution

It provides the first exact load-memory tradeoff characterization for multi-access coded caching with combinatorial topology, confirming the optimality of existing schemes.

Findings

Exact load-memory tradeoff established

Inner and outer bounds match, proving optimality

Enhances understanding of multi-access caching limits

Abstract

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.