Deep Q-Learning for Routing Schemes in SDN-Based Data Center Networks

被引:44
作者
Fu, Qiongxiao [1 ]
Sun, Enchang [1 ,2 ]
Meng, Kang [1 ]
Li, Meng [1 ]
Zhang, Yanhua [1 ]
机构
[1] Beijing Univ Technol, Fac Informat Technol, Beijing, Peoples R China
[2] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
基金
中国国家自然科学基金;
关键词
Data center; SDN; flow types; deep Q-learning;
D O I
10.1109/ACCESS.2020.2995511
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In order to adapt to the rapid development of cloud computing, big data, and other technologies, the combination of data center networks and SDN is proposed to make network management more convenient and flexible. With this advantage, routing strategies have been extensively studied by researchers. However, the strategies in the controller mainly rely on manual design, the optimal solutions are difficult to be obtained in the dynamic network environment. So the strategies based on artificial intelligence (AI) are being considered. This paper proposes a novel routing strategy based on deep Q-learning (DQL) to generate optimal routing paths autonomously for SDN-based data center networks. To satisfy the different demands of mice-flows and elephant-flows in data center networks, deep Q networks are trained for them respectively to achieve low latency and low packet loss rate for mice-flows as well as high throughput and low packet loss rate for elephant-flows. Furthermore, with the consideration of the distribution of traffic and the limitated resources of data center networks and SDN, we choose port rate and flow table utilization to describe the network state. Simulation results show that compared with Equal-Cost Multipath (ECMP) routing and Selective Randomized Load Balancing (SRL)+FlowFit, the proposed routing scheme can reduce both the average delay of mice-flows and average packet loss rate, while increase the average throughput of elephant-flows.
引用
收藏
页码:103491 / 103499
页数:9
相关论文
共 21 条
[1]  
Al-Fares M., 2008, P ACM SIGCOMM C DAT, P95
[2]  
Al-Fares M., 2010, Nsdi, V10
[3]  
[Anonymous], 2019, ICC 2019 2019 IEEE I
[4]  
[Anonymous], P 1 IEEE C NETW SOFT
[5]  
Chiesa M, 2014, IEEE INFOCOM SER, P1590, DOI 10.1109/INFOCOM.2014.6848095
[6]  
Curtis AR, 2011, IEEE INFOCOM SER, P1629, DOI 10.1109/INFCOM.2011.5934956
[7]   Balancing flow table occupancy and link utilization in software-defined networks [J].
Guo, Zehua ;
Xu, Yang ;
Liu, Ruoyan ;
Gushchin, Andrey ;
Chen, Kuan-yin ;
Walid, Anwar ;
Chao, H. Jonathan .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 89 :213-223
[8]  
Ho J, 2006, INTERNATIONAL SYMPOSIUM ON APPLICATIONS AND THE INTERNET WORKSHOPS, PROCEEDINGS, P88
[9]  
Liu J, 2014, INT SYMP WIREL, P486, DOI 10.1109/WPMC.2014.7014867
[10]   LABERIO: Dynamic load-balanced routing in OpenFlow-enabled networks [J].
Long, Hui ;
Shen, Yao ;
Guo, Minyi ;
Tang, Feilong .
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, :290-297