基于SDN的胖树数据中心网络多路径路由算法  

Multi-path Routing Algorithm for Fat-tree Data Center Network Based on SDN

作　　者：彭大芹[1] 赖香武 刘艳林[1] PENG Daqin;LAI Xiangwu;LIU Yanlin(Institute of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《计算机工程》2018年第4期41-45,65,共6页Computer Engineering

摘　　要：现有的多数路由算法未综合考虑链路实时传输状态和流量特征。为此,基于软件定义网络集中控制和全网管控的思想,提出一种基于链路实时状态和流量特征的多路径路由算法。该算法将数据流分为大流和小流,大流吞吐量要求较高,根据路径权重值进行路由,而小流数较多,处理复杂性要求较低,选择可用剩余带宽最大的路径作为其路由路径。仿真实验结果表明,与等价多路径算法和软件定义混合路由机制相比,该算法能够提高胖树数据中心网络的平均链路利用率和网络吞吐量。The existing routing algorithms do not consider the real-time transmission status and traffic characteristics of the link,a multi-path routing algorithm based on link real-time status and traffic characteristics is proposed based on the idea of Software Defined Network(SDN)centralized control and whole network control.The algorithm divides the data stream into the big stream and the small stream,and has the characteristics of high demand for the large stream throughput,routing according to the path weight value,and is available because of the big number of small streams and the low complexity of the small stream processing.The path with the largest remaining bandwidth is selected as its routing path.Simulation results show that this algorithm can improve the average link utilization and network throughput of fat-tree data center network compared with Equal Cost Multi-path(ECMP)and Software-defined Hybrid Routing(SHR)mechanism.

关 键 词：胖树 多路径路由 软件定义网络 MLF算法 链路利用率 

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