Multi-access Coded Caching Schemes From Cross Resolvable Designs

TL;DR

This paper introduces a new multi-access coded caching scheme based on cross resolvable designs, outperforming existing schemes like MaN and SPE in certain large memory scenarios by optimizing per-user rate.

Contribution

The paper proposes a novel caching and delivery scheme derived from cross resolvable designs, improving performance over prior schemes in multi-access networks.

Findings

Our scheme outperforms MaN and SPE schemes for large cache sizes.

Cross resolvable designs from affine planes are effective in the proposed scheme.

The scheme allows flexible design choices depending on the cross resolvable design selected.

Abstract

We present a novel caching and coded delivery scheme for a multi-access network where multiple users can have access to the same cache (shared cache) and any cache can assist multiple users. This scheme is obtained from resolvable designs satisfying certain conditions which we call {\it cross resolvable designs}. To be able to compare different multi-access coded schemes with different number of users we normalize the rate of the schemes by the number of users served. Based on this per-user-rate we show that our scheme performs better than the well known Maddah-Ali - Nieson (MaN) scheme and the recently proposed ("Multi-access coded caching : gains beyond cache-redundancy" by Serbetci, Parrinello and Elia) SPE scheme. It is shown that the resolvable designs from affine planes are cross resolvable designs and our scheme based on these performs better than the MaN scheme for large memory size cases. The exact size beyond which our performance is better is also presented. The SPE scheme considers only the cases where the product of the number of users and the normalized cache size is 2, whereas the proposed scheme allows different choices depending on the choice of the cross resolvable design.