# Combination Network with Multiaccess Caching

## TL;DR

This paper introduces a new caching network design that improves efficiency by allowing users to access multiple cache nodes in a combination network.

## Contribution

The novelty lies in proposing a group-wise design and explicit coded caching scheme for multi-access combination networks.

## Key findings

- A group-wise operation reduces the design complexity to an effective (Λ,L,L,Λ,M,N) instance.
- An explicit coded caching scheme is constructed using array-based representations and a CPDA.
- The proposed scheme approaches the converse bound as the cache ratio increases.

## Abstract

In the traditional (H,r,M,N) combination network, a central server storing N files communicates with K=(Hr) users through H cache-less relays. Each user has a local cache of size M files and is connected to a distinct subset of r relays. This paper studies the (H,r,L,Λ,M,N) combination network with multi-access caching, where Λ cache nodes (each of size M files) are available and each user can access L cache nodes. We show that in the regime H≥Λ and r≥L, an achievable design can be obtained via a group-wise operation, which reduces the scheme design within each group to an effective (Λ,L,L,Λ,M,N) instance. For the case Λ=H and L=r, we further propose an explicit coded caching scheme constructed via two array-based representations (a cache-node placement array and a user-retrieve array) and a derived combinatorial placement delivery array (CPDA) based on the Maddah-Ali–Niesen (MN) placement strategy. Numerical comparisons using the user-retrievable cache ratio as the evaluation metric indicate that the proposed scheme approaches the converse bound of the traditional combination network, and the performance gap diminishes as the cache ratio increases.