Paper Info
Title
Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case
Abstract
The most commonly used setting in the coded caching literature consists of the following five elements: (i) homogeneous file sizes, (ii) homogeneous cache sizes, (iii) user-independent homogeneous file popularity (i.e., all users share the same file preference), and (iv) worst-case rate analysis. While recent results have relaxed some of these assumptions, deeper understanding of the full heterogeneity setting is still much needed since traditional caching schemes place little assumptions on file/cache sizes and almost always allow each user to have his/her own file preference through individualized file request prediction. Taking a microscopic approach, this paper characterizes the exact capacity of the smallest 2-user/2-file (N = K = 2) problem but under the most general setting that simultaneously allows for (i) heterogeneous files sizes, (ii) heterogeneous cache size, (iii) user-dependent file popularity, and (iv) average-rate analysis. Solving completely the case of N = K = 2, the results would shed further insights on the performance and complexity of optimal coded caching with full heterogeneity for arbitrary N and K.
Year
DOI
Venue
2019
10.1109/ISIT.2019.8849597
2019 IEEE International Symposium on Information Theory (ISIT)
Keywords
Field
DocType
coded caching literature,homogeneous file,homogeneous cache,user-independent,file preference,worst-case rate analysis,heterogeneity setting,traditional caching schemes,individualized file request prediction,exact capacity,heterogeneous files,heterogeneous cache size,user-dependent file popularity,average-rate analysis,optimal coded caching
Discrete mathematics,Homogeneous,CPU cache,Cache,Computer science,Popularity,Theoretical computer science,Almost surely
Conference
ISSN
ISBN
Citations 
2157-8095
978-1-5386-9292-9
1
PageRank 
References 
Authors
0.35
7
2
Name
Order
Citations
PageRank
Chih-Hua Chang130.73
Chih-Chun Wang279555.20