Coded Caching for Two-Dimensional Multi-Access Networks
Mingming Zhang, Kai Wan, Minquan Cheng, Giuseppe Caire

TL;DR
This paper introduces a novel two-dimensional multi-access coded caching model, extending previous one-dimensional models, and proposes schemes that optimize cache placement and delivery to reduce transmission load in grid networks.
Contribution
It develops a grouping and transformation scheme for 2D MACC, achieving maximum local caching gain and improved coded caching performance.
Findings
Proposes a grouping scheme for divisible grid parameters.
Introduces a transformation approach from 1D to 2D MACC schemes.
Achieves lower worst-case transmission load compared to baseline methods.
Abstract
This paper studies a novel multi-access coded caching (MACC) model in the two-dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC model proposed by Hachem et al. The 2D MACC model is formed by a server containing files, cache-nodes with files located at a grid with rows and columns, and cache-less users where each user is connected to nearby cache-nodes. The server is connected to the users through an error-free shared link, while the users can retrieve the cached content of the connected cache-nodes without cost. Our objective is to minimize the worst-case transmission load over all possible users' demands. In this paper, we first propose a grouping scheme for the case where and are divisible by . By partitioning the cache-nodes and users into groups such that no two users…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Mobile Ad Hoc Networks
