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

2022/02/07 by Federico Brunero, Brunero, Federico, Petros Elia +1
Computer Science · Engineering · #Advanced Wireless Network Optimization #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2202.03039

openalex publication_date 2022/02/07 · openalex created_date 2022/04/03 · openalex updated_date 2026/07/28

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.

Related

• Fundamental Limits of Combinatorial Multi-Access Caching
• Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement
• Combinatorial Multi-Access Coded Caching with Private Caches
• Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design
• Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K,\n 1/(K-1))