Traffic Engineering in Hybrid Software Defined Network via Reinforcement Learning

被引:20
作者
Guo, Yingya [1 ,2 ]
Wang, Weipeng [1 ,2 ]
Zhang, Han [3 ]
Guo, Wenzhong [1 ,2 ]
Wang, Zhiliang [3 ]
Tian, Ying [4 ]
Yin, Xia [4 ]
Wu, Jianping [4 ]
机构
[1] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou, Peoples R China
[2] Fuzhou Univ, Fujian Key Lab Network Comp & Intelligent Informa, Fuzhou, Peoples R China
[3] Tsinghua Univ, Inst Network Sci & Cyberspace, Beijing, Peoples R China
[4] Tsinghua Univ, Dept Comp Sci & Technol, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Traffic engineering; Hybrid software defined network; Routing optimization; Reinforcement learning; INCREMENTAL DEPLOYMENT;
D O I
10.1016/j.jnca.2021.103116
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The emergence of Software Defined Network (SDN) provides a centralized and flexible approach to route network flows. Due to the technical and economic challenges in upgrading to a fully SDN-enabled network, hybrid SDN, with a partial deployment of SDN switches in a traditional network, has been a prevailing network architecture. Meanwhile, Traffic Engineering (TE) in the hydbrid SDN has attracted wide attentions from academia and industry. Previous studies on TE in the hybrid SDN are either traffic-oblivious or time-consuming, which causes routing schemes failed in responding to the dynamically-changing traffic rapidly and intelligently. Therefore, in this paper, we propose a Reinforcement Learning (RL) based method, which learns a traffic-splitting agent to address the dynamically-changing traffic and achieve the link load balancing in the hybrid SDN. Specifically, to rapidly and intelligently determine a routing scheme to the new traffic demands, a traffic-splitting agent is designed and learnt offline by exploiting the RL algorithm to establish the direct relationship between traffic demands and traffic-splitting policies. Once the traffic-splitting agent is learnt, the effective traffic splitting policies, which are used to determine the traffic-splitting ratios on SDN switches, can be generated rapidly. Additionally, to meet the interactive requirements for learning a traffic-splitting agent, a reasonable simulation environment is proposed to be constructed to avoid routing loops when traffic-splitting policies are taken. Extensive evaluations on different topologies and real traffic demands demonstrate that the proposed method achieves the comparable network performance and performs superiorities in rapidly generating the satisfying routing schemes.
引用
收藏
页数:12
相关论文
共 56 条
  • [1] Agarwal S, 2013, IEEE INFOCOM SER, P2211
  • [2] The k-means Algorithm: A Comprehensive Survey and Performance Evaluation
    Ahmed, Mohiuddin
    Seraj, Raihan
    Islam, Syed Mohammed Shamsul
    [J]. ELECTRONICS, 2020, 9 (08) : 1 - 12
  • [3] Intra-domain traffic engineering with shortest path routing protocols
    Altin, Aysegul
    Fortz, Bernard
    Thorup, Mikkel
    Umit, Hakan
    [J]. ANNALS OF OPERATIONS RESEARCH, 2013, 204 (01) : 65 - 95
  • [4] Hybrid SDN Networks: A Survey of Existing Approaches
    Amin, Rashid
    Reisslein, Martin
    Shah, Nadir
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (04): : 3259 - 3306
  • [5] [Anonymous], 1997, Ospf version 2
  • [6] [Anonymous], 2012, OPENFLOW SWITCH SPEC
  • [7] Balon S., 2019, The traffic matrices and topology of the abilene network
  • [8] BENOIT CLAISE., 2004, Cisco systems NetFlow services export version 9
  • [9] Caria M, 2015, PROCEEDINGS OF THE 2015 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM), P467, DOI 10.1109/INM.2015.7140324
  • [10] Incremental Deployment of Segment Routing Into an ISP Network: a Traffic Engineering Perspective
    Cianfrani, Antonio
    Listanti, Marco
    Polverini, Marco
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (05) : 3146 - 3160