信息网络安全 ›› 2024, Vol. 24 ›› Issue (2): 272-281.doi: 10.3969/j.issn.1671-1122.2024.02.010

• 理论研究 • 上一篇    下一篇

一种基于深度学习的SRv6网络流量调度优化算法

赵鹏程1, 于俊清1,2(), 李冬2   

  1. 1.华中科技大学网络空间安全学院,武汉 430074
    2.华中科技大学网络与计算中心,武汉 430074
  • 收稿日期:2023-10-18 出版日期:2024-02-10 发布日期:2024-03-06
  • 通讯作者: 于俊清 E-mail:yjqing@hust.edu.cn
  • 作者简介:赵鹏程(1996—),男,湖北,硕士研究生,主要研究方向为网络安全、软件定义网络|于俊清(1975—),男,内蒙古,教授,博士,CCF会员,主要研究方向为数字媒体处理与检索、网络安全、多核计算与流编译|李冬(1979—),男,湖北,高级工程师,博士,主要研究方向为计算机网络、软件定义网络、网络安全
  • 基金资助:
    国家重点研发计划(2020YFB1805601);中国高校产学研创新基金(2021FNA02005)

An Optimal Algorithm for Traffic Scheduling in SRv6 Network Based on Deep Learning

ZHAO Pengcheng1, YU Junqing1,2(), LI Dong2   

  1. 1. School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
    2. Network and Computation Center, Huazhong University of Science and Technology, Wuhan 430074, China
  • Received:2023-10-18 Online:2024-02-10 Published:2024-03-06
  • Contact: YU Junqing E-mail:yjqing@hust.edu.cn

摘要:

目前SRv6网络中的流量调度方法主要是基于固定或启发式规则的方法,缺乏灵活调度整体网络流量的能力,难以适应动态的网络环境变化。针对SRv6网络缺乏关键流识别能力的问题,文章提出一种基于深度强化学习的关键流识别算法,建立适应网络动态变化的关键流学习模型,在不同的流量矩阵中识别出对网络性能影响最大的关键流集合。针对SRv6网络流量调度问题,文章提出一种基于关键流的流量调度优化算法,采用线性规划求解出每一条关键流的最优显式路径,并采用不同的路由方式对普通流和关键流进行负载均衡。实验结果表明,该算法可显著提升SRv6网络流量负载均衡能力,降低网络端到端传输延迟。

关键词: 深度学习, 软件定义网络, 分段路由, 流量调度

Abstract:

Current traffic scheduling methods in SRv6 network are mainly based on fixed or heuristic rules, which lack of the ability to schedule overall network traffic flexibly and are difficult to adapt to dynamic network environment changes. To address the deficiency in key flow identification within SRv6 network, the article introduced a key flow identification algorithm based on deep reinforcement learning. This approach established a key flow learning model adapted to the dynamic changes of the network, identifying sets of key flows that significantly impact network performance across various traffic matrices. In response to the challenges of traffic scheduling in SRv6 network, the article developed an optimization algorithm for traffic scheduling, rooted in key flow analysis. This algorithm employed linear programming to determine the optimal explicit path for each key flow and utilized different routing methods for ordinary flows and key flows, effectively enhancing network performance. The experimental results demonstrate that the proposed traffic scheduling algorithm leads to a significant improvement in network load balancing and a substantial reduction in network end-to-end transmission delay.

Key words: deep learning, SDN, segment routing, traffic scheduling

中图分类号: