.png){kind=icon}
返回
MARL-Based Distributed Cache Placement for Wireless Networks
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2916155.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate a distributed caching strategy based on multi-agent reinforcement learning (MARL) in a cache-aided network, where all wireless nodes have limited storage capacity and serve for certain coverage. The wireless nodes can collaboratively optimize distributed caching strategy to maximize the network performance measured by the average cache hit probability. Specifically, we firstly model the distributed caching strategy problem as a fully cooperative repeated game and then analyze how to improve the average cache hit probability under the MARL framework. We further propose the caching strategy based on the frequency maximum Q-value (FMQ) and the caching strategy based on the distributed Q-learning (DQ) to optimize the distributed caching strategy. The simulation results show that the proposed FMQ-based strategy significantly improves the average cache hit probability, while the proposed DQ-based strategy can converge to the optimal strategy with probability one. Moreover, the proposed FMQ-based and DQ-based strategies are not only superior to Q-learning based strategy but also superior to the probabilistic caching placement (PCP) and most popular content (MPC) strategies.
Keyword:
Multi-agent reinforcement learning
distributed cache placement
cache hit probability
frequency maximum Q-value
distributed Q-learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
查看更多内容