Novel decentralized coded caching through coded prefetching

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-of...

Full description

Saved in:
Bibliographic Details
Published in2017 IEEE Information Theory Workshop (ITW) pp. 1 - 5
Main Authors Yi-Peng Wei, Ulukus, Sennur
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2017
Subjects
Cache memory
Conferences
Information theory
Memory management
Network topology
Prefetching
Servers
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/ITW.2017.8278044