DocumentCode :
235348
Title :
SDN-based ECMP algorithm for data center networks
Author :
Hailong Zhang ; Xiao Guo ; Jinyao Yan ; Bo Liu ; Qianjun Shuai
Author_Institution :
Sch. of Inf. Eng., Commun. Univ. of China, Beijing, China
fYear :
2014
fDate :
20-22 Oct. 2014
Firstpage :
13
Lastpage :
18
Abstract :
With the limitation of port densities in the highest-end commercial switches, topologies of data center network often take the form of a multi-rooted tree with higher-speed links. In order to achieve multipath transmission, data center uses Equal Cost Multipath (ECMP) algorithm to forward flows. ECMP algorithm is lack of dynamic scheduling mechanism. In this paper, we completed a full implementation of three scheduling algorithm in the data center network of SDN architecture. One is based on OSPF algorithm. The second is based on ECMP algorithm. In the third algorithm, we optimized the ECMP algorithm through OpenFlow protocol and made it possible to dynamically adjust the flow forwarding link according to the bandwidth utilization of core links. The evaluation results demonstrate that the third scheduling algorithm can improve performance of throughput in data center networks.
Keywords :
computer centres; computer networks; routing protocols; telecommunication network topology; telecommunication scheduling; OSPF algorithm; OpenFlow protocol; SDN-based ECMP algorithm; bandwidth utilization; core links; data center network topology; dynamic scheduling mechanism; equal cost multipath algorithm; flow forwarding link; higher-speed links; highest-end commercial switches; multipath transmission; multirooted tree; data center; ecmp; sdn; traffic engineering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing, Communications and IT Applications Conference (ComComAp), 2014 IEEE
Conference_Location :
Beijing
Print_ISBN :
978-1-4799-4813-0
Type :
conf
DOI :
10.1109/ComComAp.2014.7017162
Filename :
7017162
Link To Document :
بازگشت