基于SDN的数据中心动态优先级多路径调度算法

Data Center Dynamic Priority Multipath Scheduling Algorithm Based on SDN

随着云计算技术和分布式业务的发展,数据中心内部“东西向”大象流量激增,这部分大象流在调度不当的情况下容易发生碰撞,造成链路拥塞。本文提出一种基于软件定义网络(SDN)的动态优先级多路径调度算法(DPMS)。该算法根据数据中心流量的特点制定大象流和老鼠流调度模型,充分利用各网络节点间的冗余链路,提高资源利用率;并结合组表优化SDN架构中控制器和交换机的通信模式,降低了数据包处理时延。实验结果表明,相比ECMP和Hedera这2种调度策略,DPMS提高了网络吞吐量和链路利用率,减少了平均流完成时间,网络的整体性能有所提高。

With the development of cloud computing technology and distributed services,the“East-West”elephant flow in the data center has surged.This part of the elephant flow is prone to collisions due to improper scheduling,causing link congestion.This paper proposes a Dynamic Priority Multipath Scheduling algorithm(DPMS)based on Software-Defined Network(SDN).The algorithm develops an elephant flow and mouse flow scheduling model based on the characteristics of data center traffic,makes full use of redundant links between network nodes to improve resource utilization.Combined with the group table,the communication mode between the controller and the switch in the SDN architecture is optimized,and the packet processing delay is reduced.The experimental results show that DPMS improves network throughput and link utilization,reduces average flow completion time,and improves overall network performance compared with ECMP and Hedera scheduling strategies.