.png){kind=icon}
.png){kind=icon}
Return
Optimal Scheduling in Asynchronous Coded Caching
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2021.3137214.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies a scheduling problem in decentralized coded caching considering sequential and random request arrivals. The asynchrony between the requests begets the question of when to launch network-coded multicast to serve the requests when both the energy efficiency and the delay penalty are of concern (one can be traded for the other). To attain an optimal energy-delay tradeoff, we formulate this scheduling problem as an optimal stopping problem. In particular, for either the hard deadline or the linear penalty functions, we derive the structure of an optimal stopping rule and propose an iterative method to approximate the optimal rule. Simulation results demonstrate the effectiveness of the derived optimal stopping rules under various conditions, comparing them with several baseline scheduling strategies.
Keywords:
Servers
Delays
Prefetching
Optimal scheduling
Network coding
Indexes
Encoding
Coded caching
scheduling
energy efficiency
delay penalty
optimal stopping
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W