A Rate-Distortion Approach to Caching

被引:15
|
作者
Timo, Roy [1 ]
Bidokhti, Shirin Saeedi [2 ,3 ]
Wigger, Michele [4 ]
Geiger, Bernhard C. [5 ,6 ]
机构
[1] Ericsson Res Torshamnsgatan, S-23164 Stockholm 80, Sweden
[2] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
[3] Univ Penn, Dept Elect & Syst Engn, Philadelphia, PA 19104 USA
[4] Telecom ParisTech, Commun & Elect Dept, F-75634 Paris, France
[5] Tech Univ Munich, Inst Commun Engn, D-80333 Munich, Germany
[6] Graz Univ Technol, Signal Proc & Speech Commun Lab, A-8010 Graz, Austria
基金
奥地利科学基金会; 瑞士国家科学基金会;
关键词
Coded caching; rate-distortion; common information; COMMON INFORMATION;
D O I
10.1109/TIT.2017.2768058
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider a lossy single-user caching problem with correlated sources. We first describe the fundamental interplay between the source correlations, the capacity of the user's cache, the user's reconstruction distortion requirements, and the final delivery-phase (compression) rate. We then illustrate this interplay using a multivariate Gaussian source example and a binary symmetric source example. To fully explore the effect of the user's distortion requirements, we formulate the caching problem using f-separable distortion functions recently introduce by Shkel and Verdu. The class of f-separable distortion functions includes separable distortion functions as a special case, and our analysis covers both the expected- and excess-distortion settings in detail. We also determine what "common information" should be placed in the cache, and what information should be transmitted during the delivery phase. To this end, two new common-information measures are introduced for caching, and their relationship to the common-information measures of Wyner, Gacs, and Korner is discussed in detail.
引用
收藏
页码:1957 / 1976
页数:20
相关论文
共 50 条