.png){kind=icon}
.png){kind=icon}
Return
Online Coded Caching With Random Access
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2631552.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Coded caching
online video streaming
random access
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W