Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning

ArXi:2605.15236v1 Announce Type: cross With the coded caching, the server can use the information the users have cached to serve multiple users at a time by sending a single coded multi-casting message, i.e., the merged message, thereby relieving the peak network loads. However, for the delay-sensitive applications of the users, like the video streaming services, it becomes essential to choose which messages to merge online, considering the strict deadlines for each request.