Information-Theoretic Caching: Sequential Coding for Computing

Under the paradigm of caching, partial data are delivered before the actual requests of users are known. In this paper, this problem is modeled as a canonical distributed source coding problem with side information, where the side information represents the users' requests. For the single-user case, a singleletter characterization of the optimal rate region is established, and for several important special cases, closed-form solutions are given, including the scenario of uniformly distributed user requests. In this case, it is shown that the optimal caching strategy is closely related to total correlation and Wyner's common information. Using the insight gained from the single-user case, three two-user scenarios admitting single-letter characterization are considered, which draw connections to existing source coding problems in the literature: the Gray-Wyner system and distributed successive refinement. Finally, the model studied by Maddah-Ali and Niesen is rephrased to make a comparison with the considered information-theoretic model. Although the two caching models have a similar behavior for the single-user case, it is shown through a two-user example that the two caching models behave differently in general.


Published in:
IEEE Transactions on Information Theory, 62, 11, 6393 - 6406
Year:
2016
Publisher:
Piscataway, Institute of Electrical and Electronics Engineers
ISSN:
0018-9448
Keywords:
Laboratories:




 Record created 2016-11-07, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)