Novel Decentralized Coded Caching through Coded Prefetching
Yi-Peng Wei, Sennur Ulukus

TL;DR
This paper introduces a decentralized coded caching scheme using MDS coded prefetching that improves rate-memory trade-offs without requiring more users than files, applicable to various network topologies.
Contribution
It presents a novel decentralized coded caching scheme leveraging MDS codes, enhancing efficiency and generality over existing methods.
Findings
Achieves better rate-memory trade-off.
Does not require more users than files.
Applicable to various network topologies.
Abstract
We propose a new decentralized coded caching scheme for a two-phase caching network, where the data placed in user caches in the prefetching phase are random portions of a maximal distance separable (MDS) coded version of the original files. The proposed scheme achieves a better rate memory trade-off by utilizing the reconstruction property of MDS codes which reduces the number of transmissions that are useful only for a small subset of users in the delivery phase. Unlike the previously available coded prefetching schemes, the proposed scheme does not require to have more users than files. The proposed scheme can be viewed as a generalization of the original uncoded prefetching based decentralized coded caching scheme, and likewise, is applicable to various network topologies.
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 · Advanced Wireless Network Optimization
