期刊文献+

基于强化学习的软件定义网络流量工程研究综述

Survey on Traffic Engineering in Software-Defined Networking Based on Reinforcement Learning
在线阅读 下载PDF
导出
摘要 软件定义网络(software-defined networking,SDN)凭借其全局化、集中式的管理架构,为复杂动态网络管理带来了革命性变化,也为实施网络流量工程创造了便利条件。与此同时,强化学习因其在决策优化方面具备显著优势而备受关注。将强化学习与SDN独特架构相结合,应用于流量工程具有重要的现实意义。从理论和应用两个层面,依据技术发展脉络,全面梳理了强化学习、深度强化学习、多智能体深度强化学习在SDN流量工程中的研究进展;从方法分类、网络场景、强化学习算法、流量工程目标等多个维度,对现有研究成果进行了归纳、整理与分析,为实施SDN流量工程方法策略提供了多维视角;进一步归纳整理了强化学习与其他技术结合的研究进展,显示出其在提升流量工程策略性能方面的潜力。在总结现有研究进展的基础上,剖析了当前面临的挑战,并提出了未来的研究方向,为促进该领域的深化探索提供一定参考。 Software-defined networking(SDN),with its global and centralized management architecture,has brought revolutionary changes to the management of complex and dynamic networks,and has also created favorable conditions for network traffic engineering.Concurrently,reinforcement learning has garnered significant attention due to its pronounced advantages in decision optimization.The integration of reinforcement learning with the unique architecture of SDN and its application to SDN traffic engineering holds substantial practical significance.Firstly,from both theoretical and practical perspectives,based on the trajectory of technological development,the paper reviews the advancements in reinforcement learning,deep reinforcement learning,and multi-agent deep reinforcement learning in SDN traffic engineering.Additionally,it conducts a thorough synthesis and analysis of existing research outcomes across various dimensions,including methodological categorization,network scenarios,reinforcement learning algorithms,and traffic engineering objectives,providing a multidimensional perspective on the integration of reinforcement learning with SDN traffic engineering.Subsequently,it further summarizes the research progress of reinforcement learning combined with other technologies,demonstrating its potential to enhance the performance of traffic engineering.Ultimately,based on a summary of the current research progress,the paper analyzes the challenges faced and proposes future research directions,providing some reference for deepening exploration in this domain.
作者 刘延飞 王程锦 李超 LIU Yanfei;WANG Chengjin;LI Chao(Department of Basic Courses,Rocket Force University of Engineering,Xi’an 710025,China;School of Information and Communication,National University of Defense Technology,Wuhan 430000,China)
出处 《计算机工程与应用》 北大核心 2025年第24期1-28,共28页 Computer Engineering and Applications
基金 国家自然科学基金青年基金(62301596) 国家自然科学基金面上项目(U23B2064)。
关键词 强化学习 软件定义网络 流量工程 路由算法 reinforcement learning software-defined networking traffic engineering routing algorithm
  • 相关文献

参考文献25

二级参考文献114

  • 1张平,许晓东,韩书君,牛凯,许文俊,兰岳恒.智简无线网络赋能行业应用[J].北京邮电大学学报,2020,43(6):1-9. 被引量:8
  • 2[1]D Awduche, J Malcolm, J Agogbua, M O'Dell, JmcManus.Requirements for Traffic Engineering over MPLS [ J ]. RFC 2702,1999, (9).
  • 3[2]E Rosen, A Viswanathan, R Callon. MultiProtocol Label Switching Architecture [ EB/OL] . Work in Progress, draftietf-mplsarch06. txt, 1999-08.
  • 4[3]Daniel O Awduche. MPLS and Traffic Engineering in IP Networks[J] . IEEE Communication Magazine, 1999, (12) .
  • 5[4]George Swallow. MPLS Advantage for Traffic Engineering[ J].IEEE Communication Magazine, 1999, ( 12 ) .
  • 6Wang N,Kin H,and Pavlou G,et al..An overview of routing optimization for internet traffic engineering[J].IEEE Communications Surveys & Tutorials,2008,10(1):36-56.
  • 7Rincon D,Roughan M,and Willinger W.Towards a meaningful MRA of traffic matrices[C].Proceedings of the 8th ACM SIGCOMM Conference on Internet measurement,Vouliagmeni,Greece,2008:331-336.
  • 8Wang Y and Wang Z.Explicit routing algorithms for internet traffic engineering[C].Computer Communications and Networks,Boston,MA,USA,1999:582-588.
  • 9Wang Y,Wang Z,and Zhang L.Internet traffic engineering without full mesh overlaying[C].IEEE Infocom Proceedings,Anchorage,Alaska,USA,2001,1:565-71.
  • 10Cugola G and Nitto E.On adopting content-based routing in service-oriented architectures[J].Information and Software Technology,2008,50(1-2):22-35.

共引文献152

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部