All Dates/Times are Australian Eastern Standard Time (AEST)

Paper ID | D6-S2-T1.2 | ||

Paper Title | Coded Caching for Two Users with Distinct File Sizes |
||

Authors | Xinyu Xie, Weiyi Tan, Jinbei Zhang, Zhiyong Luo, Sun Yat-sen University, China | ||

Session | D6-S2-T1: Network Coding Tradeoffs | ||

Chaired Session: | Monday, 19 July, 22:20 - 22:40 | ||

Engagement Session: | Monday, 19 July, 22:40 - 23:00 | ||

Abstract | Coded caching has been studied extensively and extended to many scenarios because it can exploit multicast opportunities to reduce the downlink traffic on the network. The basic model of coded caching is that a server with $N$ files of the same size, is connected to several users with cache size $M$ through a shared link. Prior work [1] has derived the optimal rate-memory tradeoff of this system with the constraint of uncoded prefetching. However, when heterogeneity of file sizes is taken into account, there remains open questions. In this paper, we consider two users and $N$ files with distinct file sizes. When the cache size is large or small compared to the overall file size, i.e., $0\leq M\leq \frac{1}{2}NF_1$ or $M\geq H(\pmb{W})-\frac{1}{2}NF_1$, where $F_1$ denotes the minimum file size and $H(\pmb{W})$ represents the overall information entropy of all files in the database, we show that our proposed scheme is optimal under all possible schemes. When the cache size is mediate, i.e., $\frac{1}{2}NF_1< M< H(\pmb{W})-\frac{1}{2}NF_1$, we show that our proposed scheme is optimal under the constraint of uncoded prefetching. To obtain these results, we introduce new techniques to extend the novel cut-set bound in [2], and propose a new achievable scheme based on both files and caches sizes. |