A Rate-Distortion Approach to Caching
Autor: | Shirin Saeedi Bidokhti, Bernhard C. Geiger, Michele Wigger, Roy Timo |
---|---|
Přispěvatelé: | Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Lapidoth, Amos, Moser, Stefan M., HAL, TelecomParis |
Jazyk: | angličtina |
Rok vydání: | 2016 |
Předmět: |
FOS: Computer and information sciences
Electric engineering Theoretical computer science Computer science ddc:621.3 Computer Science - Information Theory Multivariate normal distribution 02 engineering and technology Data_CODINGANDINFORMATIONTHEORY Library and Information Sciences Lossy compression Topology Separable space Distortion Compression (functional analysis) 0202 electrical engineering electronic engineering information engineering 0601 history and archaeology ComputingMilieux_MISCELLANEOUS Computer Science::Information Theory 060102 archaeology Information Theory (cs.IT) 020206 networking & telecommunications 06 humanities and the arts Computer Science Applications Nonlinear distortion [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT] Cache [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT] Information Systems |
Zdroj: | International Zurich Seminar on Communications International Zurich Seminar on Communications, Mar 2016, Zurich, Switzerland IEEE Transactions on Information Theory International Zurich Seminar on Communications-Proceedings |
Popis: | 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 ${ {\mathsf {f}}}$ -separable distortion functions recently introduce by Shkel and Verdu. The class of ${ {\mathsf {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. |
Databáze: | OpenAIRE |
Externí odkaz: |