Centralized Caching with Unequal Cache Sizes

TL;DR

This paper proposes a new centralized caching scheme for systems with users having unequal cache sizes, achieving lower worst-case load than existing explicit schemes and close to optimal performance.

Contribution

It introduces an explicit caching scheme tailored for unequal cache sizes, improving load efficiency over prior explicit methods.

Findings

Lower worst-case load compared to existing explicit schemes

Performance within a factor of 1.11 of the optimal scheme

Effective for systems with heterogeneous cache sizes

Abstract

We address a centralized caching problem with unequal cache sizes. We consider a system with a server of files connected through a shared error-free link to a group of cache-enabled users where one subgroup has a larger cache size than the other. We propose an explicit caching scheme for the considered system aimed at minimizing the load of worst-case demands over the shared link. As suggested by numerical evaluations, our scheme improves upon the best existing explicit scheme by having a lower worst-case load; also, our scheme performs within a multiplicative factor of 1.11 from the scheme that can be obtained by solving an optimisation problem in which the number of parameters grows exponentially with the number of users.