Improved Load Balancing on Software Defined Network-based Equal Cost Multipath Routing in Data Center Network

Main Article Content

Ramadhika Dewanto
Rendy Munadi
Ridha Muldina Negara


Equal Cost Multipath Routing (ECMP) is a routing application where all available paths between two nodes are utilized by statically mapping each path to possible traffics between the source and destination hosts in a network. This configuration can lead to congestion if there are two or more traffics being transmitted into paths with overlapping links, despite the availability of less busy paths. Software Defined Networking (SDN) has the ability to increase the dynamicity of ECMP by allowing the controller to monitor available bandwidths of all links in the network in real-time. The measured bandwidth is then implemented as the basis of the calculation to determine which path traffic will take. In this research, an SDN-based ECMP application that can prevent network congestion was made by measuring the available bandwidth of each available paths beforehand, thus making different traffics transmitted on non-overlapped paths as much as possible. The proposed scheme increased the throughput by 14.21% and decreased the delay by 99% in comparison to standard ECMP when congestion occurs and has 75.2% lower load standard deviation in comparison to round-robin load balancer.


Download data is not yet available.

Article Details

How to Cite
R. Dewanto, R. Munadi, and R. M. Negara, “Improved Load Balancing on Software Defined Network-based Equal Cost Multipath Routing in Data Center Network”, INFOTEL, vol. 10, no. 3, pp. 157-162, Aug. 2018.


[1] Hailong Zhang, Xiao Guo, Jinyao Yan, Bo Liu, and Qianjun Shuai, “SDN-based ECMP algorithm for data center networks,” 2014 IEEE Comput. Commun. IT Appl. Conf., pp. 13–18, 2014.
[2] M. Chiesa, G. Kindler, and M. Schapira, “Traffic Engineering with {ECMP}: An Algorithmic Perspective,” Proc. IEEE INFOCOM, vol. 25, no. 2, pp. 1590–1598, 2014.
[3] C. Hopps, “Analysis of an Equal-Cost Multi-Path Algorithm,” Doc. RFC 2992, IETF, pp. 1–8, 2000.
[4] a. Iselt, A. Kirstadter, A. Pardigon, and T. Schwabe, “Resilient routing using MPLS and ECMP,” 2004 Work. High Perform. Switch. Routing, 2004. HPSR., pp. 345–349, 2004.
[5] M. Al-Fares, S. Radhakrishnan, and B. Raghavan, “Hedera: Dynamic Flow Scheduling for Data Center Networks.,” Nsdi, p. 19, 2010.
[6] F. Ieee et al., “Software-Defined Networking : A Comprehensive Survey,” Proc. IEEE, vol. 103, no. 1, pp. 14–76, 2015.
[7] A. L. Hf et al., “Multipath Routing with Load Balancing and Admission Control in Software Defined Networking (SDN),” vol. 4, no. c, pp. 4–9, 2016.
[8] H. Long, Y. Shen, M. Guo, and F. Tang, “LABERIO: Dynamic load-balanced routing in OpenFlow-enabled networks,” Proc. - Int. Conf. Adv. Inf. Netw. Appl. AINA, pp. 290–297, 2013.
[9] Y. L. Lan, K. Wang, and Y. H. Hsu, “Dynamic load-balanced path optimization in SDN-based data center networks,” 2016 10th Int. Symp. Commun. Syst. Networks Digit. Signal Process. CSNDSP 2016, pp. 0–5, 2016.
[10] J. Liu and L. Butler, “A Simulation and Emulation Study of SDN-Based Multipath Routing for Fat-tree Data Center Networks,” pp. 3072–3083, 2014.
[11] A. Botta, A. Dainotti, and A. Pescapé, “A tool for the generation of realistic network workload for emerging networking scenarios,” Comput. Networks, vol. 56, no. 15, pp. 3531–3547, 2012.
[12] C. Wang, G. Zhang, H. Xu, and H. Chen, “An ACO-based Link Load-Balancing Algorithm in SDN,” pp. 221–225, 2016.
[13] D. Bertsekas and R. Gallager, "Data Networks", Chapter 6, Prentice Hall, 1992.
[14] Ryu 4.26 Documentation. [Online]. Available:
[15] OpenFlow. [Online]. Available: