Abstract

This paper studies the caching system of multiple cache-enabled users with random demands. Under nonuniform file popularity, we thoroughly characterize the optimal uncoded cache placement structure for the coded caching scheme (CCS). Formulating the cache placement as an optimization problem to minimize the average delivery rate, we identify the file group structure in the optimal solution. We show that, regardless of the file popularity distribution, there are <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">at most three file groups</i> in the optimal cache placement, where files within a group have the same cache placement. We further characterize the complete structure of the optimal cache placement and obtain the closed-form solution in each of the three file group structures. A simple algorithm is developed to obtain the final optimal cache placement by comparing a set of candidate closed-form solutions computed in parallel. We provide insight into the file groups formed by the optimal cache placement. The optimal placement solution also indicates that coding between file groups may be explored during delivery, in contrast to the existing suboptimal file grouping schemes. Using the file group structure in the optimal cache placement for the CCS, we propose a new information-theoretic converse bound for coded caching that is tighter than the existing best one. Moreover, we characterize the file subpacketization in the CCS with the optimal cache placement solution and show that the maximum subpacketization level in the worst case scales as <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\mathcal{ O}}(2^{K}/\sqrt {K})$ </tex-math></inline-formula> for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> users.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.