Distributed and Adaptive Traffic Engineering with Deep Reinforcement Learning

被引:16
作者
Geng, Nan [1 ,3 ,4 ]
Xu, Mingwei [1 ,2 ,3 ,4 ]
Yang, Yuan [1 ,3 ,4 ]
Liu, Chenyi [1 ,3 ,4 ]
Yang, Jiahai [2 ,3 ,4 ]
Li, Qi [2 ,3 ]
Zhang, Shize [2 ,3 ,4 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing, Peoples R China
[2] Tsinghua Univ, Inst Network Sci & Cyberspace, Beijing, Peoples R China
[3] Beijing Natl Res Ctr Informat Sci & Technol BNRis, Beijing, Peoples R China
[4] Peng Cheng Lab PCL, Shenzhen, Peoples R China
来源
2021 IEEE/ACM 29TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS) | 2021年
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
D O I
10.1109/IWQOS52092.2021.9521303
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Lots of studies focus on distributed traffic engineering (TE) where routers make routing decisions independently. Existing approaches usually tackle distributed TE problems through traditional optimization methods. However, due to the intrinsic complexity of the distributed TE problems, routing decisions cannot be obtained efficiently, which leads to significant performance degradation, especially for highly dynamic traffic. Emerging machine learning technologies like deep reinforcement learning (DRL) provide a new choice to address TE problems in an experience-driven method. In this paper, we propose DATE, a distributed and adaptive TE framework with DRL. DATE distributes well-trained agents to the routers in the located network. Each agent makes local routing decisions independently based on link utilization ratios flooded by each router periodically. To coordinate the distributed agents to achieve the global optimization in different traffic conditions, we construct candidate paths, develop the agents carefully, and realize a virtual environment to train the agents with a DRL algorithm. We do extensive simulations and experiments using real-world network topologies with both real and synthetic traffic traces. The results show that DATE outperforms some existing approaches and yields near-optimal performance with superior robustness.
引用
收藏
页数:10
相关论文
共 29 条
[1]  
Al-Fares Mohammad, 2010, USENIX C NETW SYST D, V7, P281
[2]  
Andrews M, 2010, IEEE INFOCOM SER
[3]   Making routing robust to changing traffic demands: Algorithms and evaluation [J].
Applegate, David ;
Cohen, Edith .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (06) :1193-1206
[4]  
Aubry F., 2016, IEEE INFOCOM SER, P1, DOI 10.1109/INFOCOM.2016.7524410
[5]  
Bao YX, 2019, IEEE INFOCOM SER, P505, DOI [10.1109/infocom.2019.8737460, 10.1109/INFOCOM.2019.8737460]
[6]  
Boyan J. A., 1994, P ADV NEUR INF PROC, P671
[7]  
Einhorn E, 2008, LECT NOTES COMPUT SC, V5127, P120, DOI 10.1007/978-3-540-70587-1_10
[8]  
Fakcharoenphol J, 2004, J COMPUT SYST SCI, V69, P485, DOI [10.1016/j.jcss.2004.04.011, 10.1016/j.jcss.2004.04.01]
[9]  
Geng N., 2018, 2018 IEEEACM 26 INT
[10]  
Goodfellow I, 2016, ADAPT COMPUT MACH LE, P1