Successive Refinement to Caching for Dynamic Content

To reduce the network load during peak hours, servers deliver partial data to users during the off-peak time of the network before the actual requests are known, which is known as caching. This paper studies a single user caching problem in which the file contents are subject to dynamic modifications with respect to a certain probability distribution. To cope with the dynamical nature of the file contents, a successive refinement approach to caching is presented: partial information of the original data is cached first and then if there is a modification, a refinement to the previously cached data is delivered to the user. Given a fixed cache memory, there is a tension between the rates of two cache descriptions. The problem of optimal caching strategies is formulated through a successive Gray-Wyner network, the optimal rate region of which is characterized. Some lower and upper bounds on the performance of optimal caching strategies are developed and shown to actually yield closed form solutions for certain classes of file contents.


Published in:
2019 IEEE International Symposium on Information Theory (ISIT), 2484-2488
Presented at:
2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, July 7-12, 2019
Year:
Jul 07 2019
Publisher:
IEEE
Laboratories:




 Record created 2019-10-11, last modified 2019-10-28

Final:
Download fulltext
PDF

Rate this document:

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