Distributed Edge Caching in Ultra-Dense Fog Radio Access Networks: A Mean Field Approach
Distributed Edge Caching in Ultra-Dense Fog Radio Access Networks: A Mean Field Approach
复制标题
DOI：
10.1109/vtcfall.2018.8690593
复制
发表时间：
2018-06
期刊：
影响因子：
--
通讯作者：
Y. Hu;Yanxiang Jiang;M. Bennis;F. Zheng
中科院分区：
文献类型：
--
作者：
Y. Hu;Yanxiang Jiang;M. Bennis;F. Zheng
本文研究了超密集雾无线接入网（F-RAN）中的边缘缓存问题。考虑到时变的用户请求和超密集部署的雾接入点（F-AP），我们提出了一个动态的分布式边缘缓存方案，以联合最小化请求服务延迟和前传流量负载。考虑到F-AP之间的互动关系，我们建模的缓存优化问题作为一个随机微分博弈（SDG），捕捉F-AP状态的时间动态，并结合用户的请求状态。SDG进一步近似为平均场博弈（MFG），利用超密集性质的F-RAN。在MFG中，每个F-AP可以通过迭代求解相应的偏微分方程来独立地优化其缓存策略，而无需与其他F-AP进行任何信息交换。仿真结果表明，所提出的边缘缓存方案优于基线计划在静态和时变的用户请求。
In this paper, the edge caching problem in ultra-dense fog radio access networks (F-RAN) is investigated. Taking into account time-variant user requests and ultra-dense deployment of fog access points (F-APs), we propose a dynamic distributed edge caching scheme to jointly minimize the request service delay and fronthaul traffic load. Considering the interactive relationship among F-APs, we model the caching optimization problem as a stochastic differential game (SDG) which captures the temporal dynamics of F-AP states and incorporates user requests status. The SDG is further approximated as a mean field game (MFG) by exploiting the ultra-dense property of F-RAN. In the MFG, each F-AP can optimize its caching policy independently through iteratively solving the corresponding partial differential equations without any information exchange with other F-APs. The simulation results show that the proposed edge caching scheme outperforms the baseline schemes under both static and time-variant user requests.