基于边缘横向协作的在线内容缓存与交付方法

doi:10.12068/j.issn.1005-3026.2023.10.003

东北大学学报（自然科学版） ›› 2023, Vol. 44 ›› Issue (10): 1383-1391.DOI: 10.12068/j.issn.1005-3026.2023.10.003

基于边缘横向协作的在线内容缓存与交付方法

柳明晗，陈香伊，陈雪萍，赵海

(东北大学计算机科学与工程学院，辽宁沈阳110169)

发布日期:2023-10-27
通讯作者: 柳明晗
作者简介:柳明晗(1998-)，女，河北唐山人，东北大学硕士研究生; 赵海(1959-)，男，辽宁沈阳人，东北大学教授，博士生导师.
基金资助:
国家重点研发计划项目(2019JSJ12ZDYF01); 中央高校基本科研业务费专项资金资助项目(N2116002， 2020GFZD014).

Online Content Caching and Delivery Method Based on Edge Horizontal Collaboration

LIU Ming-han， CHEN Xiang-yi， CHEN Xue-ping， ZHAO Hai

School of Computer Science & Engineering， Northeastern University， Shenyang 110169， China.

Published:2023-10-27
Contact: CHEN Xiang-yi
About author:-
Supported by:
-

摘要/Abstract

摘要： 传统的网络架构无法满足用户对内容缓存的需求，并且在内容交付中存在低延迟要求和高通信成本之间的冲突.为了解决这些问题，在边缘节点横向协作场景下，提出了一种基于Lyapunov优化和分支定界法的在线内容缓存与交付算法，以平衡交付时延与成本、高效的决策内容缓存与内容交付.提出的算法基于Lyapunov优化理论分解连续问题为单时隙在线优化问题，并利用分支定界算法求解.仿真实验表明，提出的算法能在有限的内容交付成本预算下实现较低的平均内容交付时延、较高的内容命中率，并且能够自适应地平衡内容交付时延与交付成本.

关键词: 内容缓存；内容交付；边缘协作；Lyapunov优化；分支定界算法

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

中图分类号:

TP301.6

柳明晗，陈香伊，陈雪萍，赵海. 基于边缘横向协作的在线内容缓存与交付方法[J]. 东北大学学报（自然科学版）, 2023, 44(10): 1383-1391.

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.

参考文献

[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.

基于边缘横向协作的在线内容缓存与交付方法

Online Content Caching and Delivery Method Based on Edge Horizontal Collaboration

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	孔芝，杨青峰，赵杰，熊浚钧. 基于自适应调整权重和搜索策略的鲸鱼优化算法[J]. 东北大学学报:自然科学版, 2020, 41(1): 35-43.
[2]	刘海博，冯时，于戈. 一种基于旁信息增强的协同过滤自动编码器模型[J]. 东北大学学报:自然科学版, 2019, 40(11): 1527-1532.
[3]	孙艳蕊，陈月. 基于Timed-HITS与协同过滤的混合推荐算法[J]. 东北大学学报:自然科学版, 2019, 40(4): 467-473.
[4]	曾程宽，刘士新. 缓冲区间有限条件下的作业车间调度方法[J]. 东北大学学报:自然科学版, 2018, 39(12): 1679-1684.
[5]	董立岩，王越群，李永丽，朱琪. 基于最大平衡度的自适应随机抽样算法[J]. 东北大学学报:自然科学版, 2018, 39(6): 792-796.
[6]	范立娜，汪晋宽，高静，吕腊梅. 协作通信系统中继功率分配算法的研究[J]. 东北大学学报:自然科学版, 2017, 38(9): 1222-1225.
[7]	江锦成，吴立新，张媛媛，刘善军. 适用于大规模网络的全源最短路径重优化算法——RASP算法[J]. 东北大学学报:自然科学版, 2017, 38(7): 1037-1042.
[8]	邵新慧，彭程. 一类Sylvester矩阵方程的迭代解法[J]. 东北大学学报:自然科学版, 2017, 38(6): 909-912.
[9]	孟煜，张斌. 检测区域自适应调整的TLD多目标跟踪算法[J]. 东北大学学报:自然科学版, 2017, 38(2): 214-218.
[10]	窦景欣，孔祥希，闻邦椿. 四旋翼姿态的反步滑模自抗扰控制及稳定性[J]. 东北大学学报:自然科学版, 2016, 37(10): 1415-1420.
[11]	翟军昌，葛延峰，梁鹏，高立群. 一种参数自调整风电功率预测模型[J]. 东北大学学报:自然科学版, 2016, 37(2): 153-156.
[12]	梁振刚，蒋建伟，陈峰. 一种对圆柱形空中目标着靶参数算法的研究[J]. 东北大学学报:自然科学版, 2016, 37(1): 15-19.
[13]	单中元，乔建忠，林树宽. Pre-record:一种高效的进程动态迁移算法[J]. 东北大学学报:自然科学版, 2016, 37(1): 29-33.
[14]	翟军昌，高立群，欧阳海滨，刘宏志. 改进的新颖全局和声搜索算法[J]. 东北大学学报:自然科学版, 2015, 36(10): 1403-1407.
[15]	王皓，欧阳海滨，高立群. 求解航天器最优交会问题的改进和声搜索算法[J]. 东北大学学报:自然科学版, 2015, 36(7): 913-917.