用深度强化学习优化缓存分发中的消息合并策略,提升实时视频流的传输效率。
Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning
- 通过深度强化学习动态决定哪些请求消息可合并发送
- 在统一需求下使广播包过期率降低40.9%(0.208 vs. 0.352)
- 适合对延迟敏感的实时视频等场景,尤其适用于严格时限应用
在编码缓存中,服务器利用用户端的缓存信息,通过单个编码多播包同时服务多个用户,从而缓解高峰网络拥塞。为在视频流等时限驱动的应用中及时交付消息,需在线决策合并哪些消息,因每条请求都有时间限制。值得注意的是,虽然合并有助于当前多播包,但可能损害未来传输。本文将编码多播交付建模为带掩码的动作离散状态控制问题,采用近端策略优化训练策略网络,在统一需求基准上相比最优基线SACM++将广播包过期率ρ降低40.9%(0.208对0.352),同时在Track A所有编码多播方法中取得最佳广播效率得分σ。一个显著现象是:对于更严格的时限,合并趋于选择性而非激进,策略网络仅在约31.8%的情况下执行合并,该规律在同模拟器族内保持一致。设计聚焦于高效的成对XOR合并,更高阶(K≥3)编码视为未来工作。
原文摘要 · Abstract (English)
In the coded caching, the server uses the cached information at the users to serve multiple users in parallel with a single coded multi-casting message or packet, that is, a merged packet, and thus mitigates the peak network congestion. In order to deliver the timely messages to the users in the deadline-driven applications like the video streaming, we must determine online the messages to be merged for the delivery, as there is a time limit for each request. It is important to note that while the merging aids the current coded multi-casting packet, it could harm the future deliveries. Our solution employs the deep reinforcement learning to view the coded multi-casting delivery as a masked action-discrete state control problem, and our policy network, trained via the proximal policy optimization, performs better than SACM++. On the uniform-demand benchmark, our policy network reduces the broadcast-packet expiration ratio $ρ$ by $40.9\%$ ($0.208$ vs.\ $0.352$) with respect to the best coded multi-casting baseline (SACM++), while also attaining the best broadcast-efficiency score $σ$ across the Track~A battery among the coded multi-casting methods. One noteworthy phenomenon here is that, for the applications with stricter deadlines, the merging becomes selective instead of aggressive, since the policy network selectively merges at approximately $31.8\%$ of the chances, even though the same observation holds across the variations within the same simulator family. The focus of our design is on the efficient pairwise XOR merging, where the higher-order ($K{\ge}3$) coding can be considered as a natural generalization left for future work.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。