MATE: A multi-agent reinforcement learning approach for Traffic Engineering in Hybrid Software Defined Networks

被引:0
作者
Guo, Yingya [1 ,2 ,3 ]
Ding, Mingjie [1 ,2 ]
Zhou, Weihong [1 ,2 ]
Lin, Bin [1 ,2 ]
Chen, Cen [1 ,2 ]
Luo, Huan [1 ,2 ,3 ]
机构
[1] Fuzhou Univ, Coll Comp & Data Sci, Fuzhou, Peoples R China
[2] Fuzhou Univ, Fujian Prov Key Lab Network Comp & Intelligent Inf, Fuzhou, Peoples R China
[3] Minist Educ, Engn Res Ctr Big Data Intelligence, Fuzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Traffic Engineering; Hybrid Software Defined Networks; Multi-agent reinforcement learning; Dynamic environment; ALGORITHM;
D O I
10.1016/j.jnca.2024.103981
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Hybrid Software Defined Networks (Hybrid SDNs), which combines the robustness of distributed network and the flexibility of centralized network, is now a prevailing network architecture. Previous hybrid SDN Traffic Engineering (TE) solutions search an optimal link weight setting or compute the splitting ratios of traffic leveraging heuristic algorithms. However, these methods cannot react timely to the fluctuating traffic demands in dynamic environments and suffer a hefty performance degradation when traffic demands change or network failures happen, especially when network scale is large. To cope with this, we propose a Multi- Agent reinforcement learning based TE method MATE that timely determines the route selection for network flows in dynamic hybrid SDNs. Through dividing the large-scale routing optimization problem into small-scale problem, MATE can better learn the mapping between the traffic demands and routing policy, and efficiently make online routing inference with dynamic traffic demands. To collaborate multiple agents and speed up the convergence in the training process, we innovatively design the actor network and introduce previous actions of all agents in the training of each agent. Extensive experiments conducted on different network topologies demonstrate our proposed method MATE has superior TE performance with dynamic traffic demands and is robust to network failures.
引用
收藏
页数:10
相关论文
共 48 条
  • [1] Agarwal S, 2013, IEEE INFOCOM SER, P2211
  • [2] 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
  • [3] Multi-Agent Based Autonomic Network Management Architecture
    Arzo, Sisay Tadesse
    Bassoli, Riccardo
    Granelli, Fabrizio
    Fitzek, Frank H. P.
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2021, 18 (03): : 3595 - 3618
  • [4] Balon S., 2019, The traffic matrices and topology of the abilene network
  • [5] Caria M, 2015, PROCEEDINGS OF THE 2015 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM), P467, DOI 10.1109/INM.2015.7140324
  • [6] Chen LL, 2021, ADV NEUR IN, V34
  • [7] RL-Routing: An SDN Routing Algorithm Based on Deep Reinforcement Learning
    Chen, Yi-Ren
    Rezapour, Amir
    Tzeng, Wen-Guey
    Tsai, Shi-Chun
    [J]. IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (04): : 3185 - 3199
  • [8] A genetic algorithm for the weight setting problem in OSPF routing
    Ericsson, M
    Resende, MGC
    Pardalos, PM
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (03) : 299 - 333
  • [9] Fortz B., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P519, DOI 10.1109/INFCOM.2000.832225
  • [10] A Multi-agent Reinforcement Learning Perspective on Distributed Traffic Engineering
    Geng, Nan
    Lan, Tian
    Aggarwal, Vaneet
    Yang, Yuan
    Xu, Mingwei
    [J]. 2020 IEEE 28TH INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (IEEE ICNP 2020), 2020,