Blind Updates in Coded Caching
Suman Ghosh, Prasad Krishnan, Lakshmi Prasad Natarajan

TL;DR
This paper introduces a new method for efficiently updating cached files in a centralized coded caching system when files are replaced with correlated new versions, minimizing broadcast communication.
Contribution
It proposes a novel coded transmission strategy for blind cache updates and derives bounds on the minimal communication cost, improving efficiency in correlated file replacement scenarios.
Findings
New coded update scheme reduces broadcast cost for sparse updates.
MDS-based scheme is order-optimal for dense updates.
Derived converse bounds for linear strategies.
Abstract
We consider the centralized coded caching system where a library of files is available at the server and their subfiles are cached at the clients as prescribed by a placement delivery array (PDA). We are interested in the problem where a specific file in the library is replaced with a new file at the server, the contents of which are correlated with the file being replaced, and this change needs to be communicated to the caches. Upon replacement, the server has access only to the updated file and is unaware of its differences with the original, while each cache has access to specific subfiles of the original file as dictated by the PDA. We model the correlation between the two files by assuming that they differ in at the most subfiles, and aim to reduce the number of bits broadcast by the server to update the caches. We design a new elegant coded transmission strategy for the…
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.
