Fundamental Limits of Combinatorial Multi-Access Caching

by   Federico Brunero, et al.

This work identifies the fundamental limits of Multi-Access Coded Caching (MACC) where each user is connected to multiple caches in a manner that follows a generalized combinatorial topology. This topology stands out as it allows for unprecedented coding gains, even with very modest cache resources. First, we extend the setting and the scheme presented by Muralidhar et al. to a much more general topology that supports both a much denser range of users and the coexistence of users connected to different numbers of caches, all while maintaining the astounding coding gains, here proven to be exactly optimal, associated with the combinatorial topology. This is achieved, for this generalized topology, with a novel information-theoretic converse that we present here, which establishes, together with the scheme, the exact optimal performance under the assumption of uncoded placement. We subsequently consider different connectivity ensembles, including the very general scenario of the entire ensemble of all possible network connectivities/topologies, where any user can be connected to any subset of caches arbitrarily. For these settings, we develop novel converse bounds on the optimal performance averaged over the ensemble's different connectivities, considering the additional realistic scenario that the connectivity at delivery time is entirely unknown during cache placement. This novel analysis of topological ensembles leaves open the possibility that currently-unknown topologies may yield even higher gains, a hypothesis that is part of the bigger question of which network topology yields the most caching gains.


page 1

page 2

page 3

page 4


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

Recently, Muralidhar et al. proposed a novel multi-access system model w...

Fundamental Limits of Topology-Aware Shared-Cache Networks

This work studies a well-known shared-cache coded caching scenario where...

Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement

This work considers the combinatorial multi-access coded caching problem...

Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching

The work explores the fundamental limits of coded caching in heterogeneo...

On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches

This paper investigates the fundamental tradeoff between cache size and ...

Caching in Combination Networks: A Novel Delivery by Leveraging the Network Topology

Maddah-Ali and Niesen (MAN) in 2014 surprisingly showed that it is possi...

Multi-Access Distributed Computing

Coded distributed computing (CDC) is a new technique proposed with the p...

Please sign up or login with your details

Forgot password? Click here to reset