%0 Journal Article
%A HAN Dan-tao
%A SONG Mei
%A TENG Ying-lei
%A ZHANG Yong
%A WANG Meng-zhe
%T Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks
%D 
%R 10.13190/j.jbupt.2019-104
%J Journal of Beijing University of Posts and Telecommunications
%P 29-39
%V 43
%N 2
%X 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.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2019-104