基于平均场博弈的超密集网络边缘缓存和删除分配研究

doi:10.13190/j.jbupt.2019-104

北京邮电大学学报 ›› 2020, Vol. 43 ›› Issue (2): 29-39.doi: 10.13190/j.jbupt.2019-104

基于平均场博弈的超密集网络边缘缓存和删除分配研究

王孟哲¹, 滕颖蕾¹, 宋梅¹, 韩丹涛², 张勇¹

1. 北京邮电大学电子工程学院, 北京 100876;
2. 机械工业仪器仪表综合技术经济研究所, 北京 100055

收稿日期:2019-05-31 发布日期:2020-04-28
通讯作者: 滕颖蕾(1983-),女,副教授,E-mail:lilytengtt@gmail.com. E-mail:lilytengtt@gmail.com
作者简介:王孟哲(1994-),男,硕士生.
基金资助:
国家自然科学基金项目（61771072）；科技部重点研发基金项目（2018YFB120022）

Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks

WANG Meng-zhe¹, TENG Ying-lei¹, SONG Mei¹, HAN Dan-tao², ZHANG Yong¹

1. School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2. Instrument Technology and Economy Institute, Beijing 100055, China

Received:2019-05-31 Published:2020-04-28

摘要/Abstract

摘要： 超密集网络设备数目庞大导致缓存分配算法复杂度极高，频繁地缓存和删除同样的内容导致的系统不稳定，为此，提出了基于平均场博弈（MFG）的分布式缓存分配算法和基于李雅普诺夫漂移加惩罚（DPP）方法的分布式删除分配算法.MFG方法使缓存分配算法的复杂度与基站数目无关.DPP方法将具有时间相关性的删除分配问题解耦成为每个时刻的问题，并求解得到了兼顾系统稳定性和网络开销优化的删除分配策略.仿真结果表明，MFG方法能够使网络最优控制策略快速收敛，并且在超密集场景下得到明显低于基本缓存分配方法的网络开销；李雅普诺夫DPP方法能够实现兼顾网络开销优化的网络缓存和删除稳定性.

关键词: 超密集网络, 平均场, 平均场博弈, 李雅普诺夫理论, 漂移加惩罚

Abstract: A distributed caching allocation algorithm based on mean-field game (MFG) and a distributed deleting allocation algorithm based on Lyapunov drift-plus-penalty (DPP) method were proposed to solve the problem of caching allocation algorithms' extremely high complexity caused by lots of devices in ultra-dense network and the problem of system instability caused by caching and deleting same content frequently. The caching allocation algorithm's complexity independent of the number of base stations is made by MFG. The time-correlated deleting allocation problem into problems each time slot is decoupled by DPP. Thereafter the deleting allocation policy for the tradeoff between system stability and minimizing network cost gets solved. Simulation shows that MFG can both make the network optimal control strategy converge quickly and save network cost obviously compared to baseline caching allocation method under ultra-dense scenario. Lyapunov DPP method can ensure network caching and deleting stability while minimizing network cost.

Key words: ultra-dense network, mean-field, mean-field game, Lyapunov theory, drift-plus-penalty

中图分类号:

TN929.53

王孟哲, 滕颖蕾, 宋梅, 韩丹涛, 张勇. 基于平均场博弈的超密集网络边缘缓存和删除分配研究[J]. 北京邮电大学学报, 2020, 43(2): 29-39.

WANG Meng-zhe, TENG Ying-lei, SONG Mei, HAN Dan-tao, ZHANG Yong. Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks[J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(2): 29-39.

参考文献

[1] Chun B G,Chaudhuri K, Wee H, et al. Selfish caching in distributed systems:a game-theoretic analysis[M]. New York:Association for Computing Machinery, 2004:21-30.
[2] Yang C, Li J, Semasinghe P, et al. Distributed interference and energy-aware power control for ultra-dense D2D networks:a mean field game[J]. IEEE Transactions on Wireless Communications, 2017, 16(2):1205-1217.
[3] Al-Zahrani A, Yu F R,Huang M. A joint cross-layer and co-layer interference management scheme in hyper-dense heterogeneous networks using mean-field game theory[J]. IEEE Transactions on Vehicular Technology, 2016, 65(3):1522-1535.
[4] Baillieul J, Samad T. Encyclopedia of systems and control[M]. London:Springer London, 2014:1-6.
[5] Hamidouche K, Saad W, Debbah M, et al. Mean-field games for distributed caching in ultra-dense small cell networks[C]//American Control Conference. Boston:[s. n.], 2016:4699-4704.
[6] Kim H,Park J, Bennis M, et al. Ultra-dense edge caching under spatio-temporal demand and network dynamics[C]//IEEE International Conference on Communications (ICC). Paris:[s. n.] 2017:1-7.
[7] Neely M J. Stochastic network optimization with application to communication and queueing systems[J]. Synthesis Lectures on Communication Networks, 2010, 3(1):1-211.
[8] Huang L, Neely M J. Utility optimal scheduling in processing networks[J]. Performance Evaluation, 2011, 68(11):1002-1021.
[9] Samarakoon S, Bennis M, Saad W, et al. Ultra dense small cell networks:turning density into energy efficiency[J]. IEEE Journal on Selected Areas in Communications, 2016, 34(5):1267-1280.
[10] 张琪. 联合缓存与无线传输的理论性能分析及优化策略研究[D]. 北京:北京邮电大学, 2018.
[11] Cao Y, Tao M, Xu F,et al. Fundamental storage-latency tradeoff in cache-aided MIMO interference networks[J]. IEEE Transactions on Wireless Communications,2017, 16(8):5061-5076.
[12] Gueant O, Lasry J, Lions P. Mean field games and applications[M]. Berlin, Germany:Springer Berlin Heidelberg, 2011:205-266.
[13] Bernt O. Stochastic differential equations[J]. IEEE Transactions on Automatic Control, 2006, 51(10):1731-1732.
[14] Debbah M, Couillet R, Perlaza S M, et al. Electrical vehicles in the smart grid:a mean field game analysis[J]. IEEE Journal on Selected Areas in Communications, 2012, 30(6):1086-1096.
[15] Aziz M, Caines P E. A mean field game computational methodology for decentralized cellular network optimization[J]. IEEE Transactions on Control Systems Technology, 2017, 25(2):563-576.
[16] Li J, Chen Y T,Chen G,et al. Computational partial differential equations using matlab (Chapman & Hall/CRC Applied Mathematics & Nonlinear Science)[M]. New York:Taylor & Francis, 2011.

基于平均场博弈的超密集网络边缘缓存和删除分配研究

Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 5

编辑推荐

Metrics

本文评价

[1]	康玲, 王翊, 胡艳军, 蒋芳, 李莉萍. 超密集网络中基于判别函数的聚类算法[J]. 北京邮电大学学报, 2022, 45(2): 104-109.
[2]	卓新建, 王文璇, 李慧嘉. 有标记网络中的病毒传播机理及动态特性[J]. 北京邮电大学学报, 2021, 44(3): 73-78.
[3]	田心记, 张浩天, 李晓静, 张长森. UDN中基于JR-CoMP的分簇和资源分配方案[J]. 北京邮电大学学报, 2019, 42(3): 72-78.
[4]	许焱平, 贾文杰, 李晓静, 张长森, 田心记. 超密集网络中一种改进的分簇及资源分配方案[J]. 北京邮电大学学报, 2019, 42(2): 77-82.
[5]	张海波, 李虎, 陈善学, 邹剑. 超密集网络中混合接入方式下基于分组的资源分配[J]. 北京邮电大学学报, 2018, 41(3): 69-74.