Journal article
Online Coded Caching with Random Access
Q Yan, U Parampalli, X Tang, Q Chen
IEEE Communications Letters | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Published : 2017
Abstract
In this letter, we consider a caching network with two characteristics: first, the operations of users' caches have to be performed on the fly, and second, each user has access to the system with a known probability. Particularly, we intend to characterize approximately the optimal long-term average rate of the shared link. By utilizing the knowledge of eviction in the server and applying the technique of coded caching to the active users in each time, we propose and analyze a new scheme called coded outdated file eviction for random access (coded OER). Furthermore, we present a tight upper bound on the performance of the proposed coded OER scheme and prove that it is approximately optimal.
Grants
Awarded by National Science Foundation of China (NSFC)
Awarded by National High Technology Development 863 Program of China
Awarded by NSFC
Funding Acknowledgements
The work of Q. Yan and X. Tang was supported in part by the National Science Foundation of China (NSFC) under Grant 61325005 and National High Technology Development 863 Program of China under Grant 2015AA01A710. The work of U. Parampalli was supported in part by the Communications Sensing and Coding Research Network, the International Research and Research Training Fund, the University of Melbourne. The work of Q. Chen was supported in part by the NSFC under Grant No. 61271246. The associate editor coordinating the review of this letter and approving it for publication was G. Reali.