.png){kind=icon}
Return
Asynchronous Coded Caching With Uncoded Prefetching
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2020.3003907.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time. In this work, we formulate and study the coded caching problem when the file requests from the users arrive at different times. We assume that each user also has a prescribed deadline by which they want their request to be completed. In the offline case, we assume that the server knows the arrival times before starting transmission and in the online case, the user requests are revealed to the server over time. We present a linear programming formulation for the offline case that minimizes the overall transmission rate from the server subject to the constraint that each user meets his/her deadline. While the online case is much harder, we introduce a novel heuristic for it and show that under certain conditions, with high probability the request of each user can be satisfied with her/his deadline. Our simulation results indicate that in the presence of mild asynchronism, much of the benefit of coded caching can still be leveraged.
Keywords:
Servers
Encoding
Indexes
IEEE transactions
Programming
Synchronization
Computers
Coded caching
asynchronous
deadlines
linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more