Fundamental Limits of Caching: Improved Bounds For Small Buffer Users

TL;DR

This paper introduces a new coded caching strategy for users with small buffers, achieving lower peak rates and matching the theoretical cut-set bound, thus advancing understanding of caching limits.

Contribution

A novel coded caching scheme for small buffer users that improves peak rate bounds and aligns with the cut-set bound in an information-theoretic framework.

Findings

Achieves lower peak rates than previous methods

Matches the cut-set bound analytically

Validates the theoretical optimality of the proposed scheme

Abstract

In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coincides with the cut-set bound analytically in an information-theoretic view.