Online Coded Caching With Random Access
Qifa Yan, Udaya Parampalli, Xiaohu Tang, Qingchun Chen · IEEE Communications Letters · 2016
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.