基于SDN的数据中心网络多路径流量调度算法  

SDN-based Multipath Traffic Scheduling Algorithm for Data Center Network

作　　者：金勇 刘亦星[1,2] 王欣欣 JIN Yong;LIU Yi-xing;WANG Xin-xin(School of Telecommunication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;Chongqing Key Lab of Mobile Communications Technology,Chongqing University of Post and Communications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《计算机科学》2019年第6期90-94,共5页Computer Science

基　　金：长江学者和创新团队发展计划项目(IRT_16R72)资助

摘　　要：针对数据中心网络带宽利用率低、网络性能差的问题,提出一种基于SDN架构下,结合多因素的多路径流量调度算法(MSF).算法利用SDN架构中控制与转发分离的特性以及利用控制器集中控制的方式来为数据流计算路由,首先计算出源主机和目的主机间所有可达路径中跳数最少的路径集,然后找出最短路径集中关键度最小的数条路径,最后结合流特征找出代价最低的路径作为最终流表的下发路径.实验结果表明,在不同的流量模型下,与ECMP和Hedera两种算法相比,所提算法提升了链路带宽利用率和吞吐量,减少了流量的平均往返时延,从而提高了数据中心的整体网络性能.In order to solve the problems of low bandwidth utilization and poor network performance in data center networks,this paper proposed a multi-path traffic scheduling algorithm considering multiple factors(MSF)based on SDN.The algorithm utilizes the characteristics of control and forwarding separation in Software Defined Network(SDN)architecture and the centralized control of the controller to calculate the route for the data stream.Firstly,this algorithm calculates all the path sets with the shortest hops from all feasible paths between source host and destination host,then finds out the paths with the least criticality in the shortest path sets,and finally seeks out the lowest-cost path as the down-forwarding path in final flow table.Experimental results show that the proposed algorithm improves the network bandwidth utilization and throughput,and reduces the average round-trip time of traffic compared with the ECMP algorithm and Hedera algorithm under different traffic models,thus improving the overall network performance of data center.

关 键 词：数据中心网络 软件定义网络 流量调度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]