# Coded Caching with Shared Caches and Private Caches

Source: [Coded Caching with Shared Caches and Private Caches](<https://www.sota2.com/research/paper/68fa5b941e209131ce9c9a21>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T17:09:39.080Z

Authors: Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan

Published: 2022-09-01T09:03:37.000Z

## Abstract

This work studies the coded caching problem in a setting where the users are simultaneously endowed with a private cache and a shared cache. The setting consists of a server connected to a set of users, assisted by a smaller number of helper nodes that are equipped with their own storage. In addition to the helper cache, each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache can serve an arbitrary number of users, but each user gets served by only one helper cache. We consider two scenarios: (a) the server has no prior information about the user-to-helper cache association, and (b) the server knows the user-to-helper cache association at the placement phase itself. We design centralized coded caching schemes under uncoded placement for the above two settings. For case (b), two schemes are proposed that are optimal in certain memory regimes. Further, a cut-set based lower bound is derived and used to show that one of the proposed schemes for case (b) is optimal in certain memory regime.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2209.00299>)

[PDF](<https://arxiv.org/pdf/2209.00299.pdf>)
