A Rate-Distortion Approach to Caching

DOI10.1109/TIT.2017.2768058MaRDI QIDQ4566756zbMATH OpenFDO

Authors Roy Timo, Shirin Saeedi Bidokhti, Michèle Angela Wigger, Bernhard C. Geiger

Publication date 27 June 2018

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

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

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Measures of information, entropy (94A17)

Abstract: This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal tradeoffs between the delivery rate, cache capacity and reconstruction distortions for a single-user problem and some special cases of a two-user problem. Our analysis considers discrete memoryless sources, expected- and excess-distortion constraints, and separable and f-separable distortion functions. We also establish a strong converse for separable-distortion functions, and we show that lossy versions of common information (G'{a}cs-K"{o}rner and Wyner) play an important role in caching. Finally, we illustrate and explicitly evaluate these laws for multivariate Gaussian sources and binary symmetric sources.

Cited in

(3)

• Information-Theoretic Caching: Sequential Coding for Computing
• Caching and Delivery via Interference Elimination
• Adaptive Coded Caching for Fair Delivery Over Fading Channels

This page was built for publication: A Rate-Distortion Approach to Caching

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