%0 Journal Article
%T 数据中心网络多路径路由算法<br>Multipath routing algorithm for data center networks
%A 杨洋
%A 杨家海
%A 秦董洪
%J 清华大学学报（自然科学版）
%D 2016
%R 10.16511/j.cnki.qhdxxb.2016.21.031
%X 数据中心网络流量分布的不均衡增加了网络拥塞产生的可能性, 由于数据中心网络的流量特性, 使得传统IP网络的流量工程方法不一定适合。该文在SDN/OF(software defined network/OpenFlow)的结构下, 提出了一种基于多路径传输的动态路由算法 (dynamic routing algorithm based on multipath propagation, Dramp)并作为SDN/OF结构中应用层的流量均衡策略。该算法在重新定义链路关键度并求解链路权值优化问题的基础上, 能充分利用数据中心网络中存在的冗余路径, 在完成细粒度流量均衡的同时, 能很好地克服控制器的计算开销, 完成路由优化的目标。通过在Mininet仿真平台中部署并进行仿真实验, 与等开销多路径路由算法ECMP(equal-cost multi-path)以及GFF(global first fit)路由算法相比较, 结果展示了Dramp的优越性能, 同时证明了在数据中心网络中采用Dramp作为流量工程的解决方案更简单、更实用。<br>Abstract：Unbalanced distributions of traffic in the data center networks increase the network congestion. The special traffic characteristics in data center networks reduce the effectiveness of traditional IP network traffic engineering methods. This paper presents a dynamic routing algorithm based on multipath propagation (Dramp) using software defined for network/OpenFlow (SDN/OF) frameworks. This algorithm makes efficient use of multiple paths by redefining the degree of the critical link and solving an optimization problem using link weights. The objective is to reduce the overhead in the control plane for a fine-grained traffic balance for routing optimization in data center networks. This paper compares the Dramp algorithm with the equal-cost multipath (ECMP) and global first fit (GFF) routing algorithms on the Mininet simulation platform. The results show that Dramp gives the best performance; thus, Dramp is simpler and more practical for traffic engineering in data center networks.
%K 网络拥塞
%K 软件定义网络(SDN)
%K 链路关键度
%K 多路径路由
%K 流量均衡
%K &lt
%K br&gt
%K network congestion
%K software defined network (SDN)
%K degree of critical link
%K multipath routing
%K traffic balance
%U http://jst.tsinghuajournals.com/CN/Y2016/V56/I3/262