Coded Caching With Distributed Storage

DOI10.1109/TIT.2019.2940979zbMATH Open1433.94050arXiv1611.06591OpenAlexW2973141671MaRDI QIDQ5211536FDOQ5211536

Authors: Tianqiong Luo, Vaneet Aggarwal, Borja Peleato 

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Content delivery networks store information distributed across multiple servers, so as to balance the load and avoid unrecoverable losses in case of node or disk failures. Coded caching has been shown to be a useful technique which can reduce peak traffic rates by pre-fetching popular content at the end users and encoding transmissions so that different users can extract different information from the same packet. On one hand, distributed storage limits the capability of combining content from different servers into a single message, causing performance losses in coded caching schemes. But, on the other hand, the inherent redundancy existing in distributed storage systems can be used to improve the performance of those schemes through parallelism. This paper designs a scheme combining distributed storage of the content in multiple servers and an efficient coded caching algorithm for delivery to the users. This scheme is shown to reduce the peak transmission rate below that of state-of-the-art algorithms.

Full work available at URL: https://arxiv.org/abs/1611.06591

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (6)

• Network Coding for Distributed Storage Systems
• Caching Content under Digital Rights Management
• Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach
• Multi-Server Coded Caching
• Hierarchical Coded Caching
• Codes for Distributed Storage

This page was built for publication: Coded Caching With Distributed Storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211536)