Decentralized and Online Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching
Elizabath Peter, B. Sundar Rajan

TL;DR
This paper establishes fundamental limits and optimal schemes for decentralized, shared-cache coded caching with uncoded prefetching, including online updates and error correction, advancing understanding of cache network efficiency.
Contribution
It derives the optimal worst-case delivery time for shared-cache networks with uncoded placement and proposes improved delivery and online update schemes.
Findings
Optimal worst-case delivery time derived using index-coding converse.
An error-correcting delivery scheme is proposed for worst-case demands.
Extended results to online caching with cache updates based on demand sequence.
Abstract
Decentralized coded caching scheme, introduced by Maddah-Ali and Niesen, assumes that the caches are filled with no coordination. This work identifies a decentralized coded caching scheme -- under the assumption of uncoded placement -- for shared cache network, where each cache serves multiple users. Each user has access to only a single cache and the number of caches is less than or equal to the number of users. For this setting, we derive the optimal worst-case delivery time for any user-to-cache association profile where each such profile describes the number of users served by each cache. The optimality is shown using an index-coding based converse. Further, we improve the delivery scheme to accommodate redundant demands. Also, an optimal linear error correcting delivery scheme is proposed for the worst-case demand scenario. Next, we consider the Least Recently Sent (LRS) online…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
