Online Content Caching and Delivery Method Based on Edge Horizontal Collaboration

doi:10.12068/j.issn.1005-3026.2023.10.003

Abstract

Abstract: Traditional network architectures cannot meet user needs for content caching， and there is a conflict between low latency requirements and high communication costs in content delivery. To address these problems， an online content caching and delivery algorithm based on Lyapunov optimization and branch and bound method is proposed under the scenario of horizontal collaboration between edge nodes to balance delivery delay and cost and to make efficient decisions on content caching and content delivery. The proposed algorithm decomposes the continuous problem into a single slot online optimization problem based on Lyapunov optimization theory， and solves them using branch and bound algorithms. Simulation experiments showed that the proposed algorithm can achieve lower average content delivery delay and higher content hit rate under a limited content delivery cost budget. It can also adaptively balance content delivery delay and delivery cost.

Key words: content caching; content delivery; edge collaboration; Lyapunov optimization; branch and bound algorithm

CLC Number:

TP301.6

LIU Ming-han， CHEN Xiang-yi， CHEN Xue-ping， ZHAO Hai. Online Content Caching and Delivery Method Based on Edge Horizontal Collaboration[J]. Journal of Northeastern University(Natural Science), 2023, 44(10): 1383-1391.

References

[1]Cisco.Cisco annual internet report(2018—2023)white paper ［EB/OL］.(2022-03-10)［2022-03-30］ https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html.
[2]Muhammad A，Sorkhoh I，Qu L，et al.Delay-sensitive multi-source multicast resource optimization in NFV-enabled networks:a column generation approach［J］.IEEE Transactions on Network and Service Management，2021，18(1):286-300.
[3]Sun Y P，Chen Z Y，Tao M X，et al.Communications，caching，and computing for mobile virtual reality:modeling and tradeoff［J］.IEEE Transactions on Communications，2019，67(11):7573-7586.
[4]Liu D，Chen B Q，Yang C Y，et al.Caching at the wireless edge:design aspects，challenges，and future directions［J］.IEEE Communications Magazine，2016，54(9):22-28.
[5]Chu W B，Yu Z W，Lui J C S，et al.Jointly optimizing throughput and content delivery cost over lossy cache networks［J］.IEEE Transactions on Communications，2021，69(6):3846-3863.
[6]Malik A，Kim J，Kim K S，et al.A personalized preference learning framework for caching in mobile networks［J］.IEEE Transactions on Mobile Computing，2021，20(6):2124-2139.
[7]Chen Q，Wang W，Yu F R，et al.Content caching oriented popularity prediction:a weighted clustering approach［J］.IEEE Transactions on Wireless Communications，2021，20(1):623-636.
[8]Jiang W，Feng G，Qin S.Optimal cooperative content caching and delivery policy for heterogeneous cellular networks［J］.IEEE Transactions on Mobile Computing，2017，16(5):1382-1393.
[9]Saputra Y M，Hoang D T，Nguyen D N，et al.A novel mobile edge network architecture with joint caching-delivering and horizontal cooperation［J］.IEEE Transactions on Mobile Computing，2021，20(1):19-31.
[10]Garg N，Sellathurai M，Bhatia V，et al.Online content popularity prediction and learning in wireless edge caching［J］.IEEE Transactions on Communications，2020，68(2):1087-1100.
[11]Shanmugam K，Golrezaei N，Dimakis A G，et al.FemtoCaching:wireless content delivery through distributed caching helpers［J］.IEEE Transactions on Information Theory，2013，59(12):8402-8413.
[12]Chang J L，Zhang N F，Tao M X，et al.Federated multi-agent reinforcement learning for collaborative edge caching in content delivery networks［C］ // 2022 14th International Conference on Wireless Communications and Signal Processing.Nanjing，2022:166-170.
[13]Asheralieva A，Niyato D.Combining contract theory and Lyapunov optimization for content sharing with edge caching and device-to-device communications［J］.IEEE/ACM Transactions on Networking，2020，28(3):1213-1226.
[14]Kumar S，Misra S.Enabling multi-source device-to-device content delivery in cellular networks［J］.IEEE Transactions on Vehicular Technology，2021，70(10):10853-10863.
[15]Qu Z H，Ye B L，Tang B，et al.Cooperative caching for multiple bitrate videos in small cell edges［J］.IEEE Transactions on Mobile Computing，2020，19(2):288-299.
[16]Neely M J.Stochastic network optimization with application to communication and queueing systems［M］.San Rafael:Morgan & Claypool Publishers，2010.
[17]Vielma J P.Mixed integer linear programming formulation techniques［J］.SIAM Review，2015，57(1):3-57.
[18]Chen X Y，Bi Y G，Chen X P，et al.Dynamic service migration and request routing for microservice in multi-cell mobile edge computing［J］. IEEE Internet of Things Journal，2022，9(15):13126-13143.
[19]Smith D R.Random trees and the analysis of branch and bound procedures［J］.Journal of the ACM，1984，31(1):163-188.
[20]Fowkes J M，Gould N I M，Farmer C L.A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions［J］.Journal of Global Optimization，2013，56:1791-1815.
[21]Hefeeda M，Saleh O.Traffic modeling and proportional partial caching for peer-to-peer systems［J］.IEEE/ACM Transactions on Networking，2008，16(6):1447-1460.
[22]Wang X F，Li R B，Wang C Y，et al.Attention-weighted federated deep reinforcement learning for device-to-device assisted heterogeneous collaborative edge caching［J］.IEEE Journal on Selected Areas in Communications，2021，39(1):154-169.
[23]Hassine N B，Milocco R，Minet P.ARMA based popularity prediction for caching in content delivery networks［C］ // 2017 Wireless Days.Porto，2017:113-120.