Multipath routing algorithm for data center networks

doi:10.16511/j.cnki.qhdxxb.2016.21.031

Download: PDF(1610 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

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.

Keywords network congestion software defined network (SDN) degree of critical link multipath routing traffic balance

ZTFLH:

TP393.2

Issue Date: 15 March 2016

	Service

	E-mail this article
	E-mail Alert
	RSS
	Articles by authors

	YANG Yang
	YANG Jiahai
	QIN Donghong

Cite this article:

YANG Yang,YANG Jiahai,QIN Donghong. Multipath routing algorithm for data center networks[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(3): 262-268.

URL:

http://jst.tsinghuajournals.com/EN/10.16511/j.cnki.qhdxxb.2016.21.031 OR http://jst.tsinghuajournals.com/EN/Y2016/V56/I3/262

[1] Arsalan T, Martin C, Teemu K, et al. Applying nox to the datacenter[C]//Proceedings of workshop on Hot Topics in Networks (HotNets-VIII). New York, NY, USA:ACM, 2009.
[2] Theophilus B, Ashok A, Aditya A, et al. MicroTE:Fine grained traffic engineering for data centers[C]//CoNEXT'11 Conference on emerging Networking Experiments and Technologies. New York, NY, USA:ACM, 2011, 8.
[3] Mohammad A, Sivasankar R, Barath R, et al. Hedera:Dynamic flow scheduling for data-center networks[C]//NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation. Berkeley, CA, USA:USENIX Association, 2010:19-19.
[4] Andrew R, Wonho K, Praveen Y. Mahout:Low-overhead datacenter traffic management using end-host-based elephant detection[C]//INFOCOM'11 Proceedings IEEE INFOCOM 2011. Shanghai, China:IEEE, 2011:1629-1637.
[5] Jonathan P, Amy O, Hari B, et al. Fastpass:A centralized zero-queue datacenter network[C]//SIGCOMM'14 Proceedings of the 2014 ACM conference on SIGCOMM. New York, NY, USA:ACM, 2014:307-318.
[6] Andrew R, Jeffrey C, JeanT, et al. DevoFlow:Scaling flow management for high-performance networks[C]//SIGCOMM'11 Proceedings of the 2014 ACM conference on SIGCOMM. New York, NY, USA:ACM, 2011:254-265.
[7] Yukihiro N, Kazuki H, Lee C, et al. DomainFlow:Practical flow management method using multiple flow tables in commodity switches[C]//CoNEXT'13 Proceedings of the ninth ACM conference on Emerging networking experiments and technologies. New York, NY, USA:ACM, 2013:399-404.
[8] Eric J, Deng P, Liu J, et al. Asimulation and emulation study of sdn-based multipath routing for fat-tree data center networks[C]//WSC'14 Proceedings of the 2014 Winter Simulation Conference. Piscataway, NJ, USA:IEEE Press, 2014:3072-3083.
[9] Albert G, James R H, Navendu J, et al. VL2:A scalable and flexible data center network[J]. Communications of the ACM, 2011, 54(3):95-104.
[10] Zhou J, Malveeka T, Zhu M, et al. WCMP:Weighted cost multipathing for improved fairness in data centers[C]//EuroSys'14 Proceedings of the Ninth European Conference on Computer Systems. New York, NY, USA:ACM, 2014, 5.
[11] Pettit J. Open vSwitch. (2014-11-03). http://openvswitch.org/pipermail/announce/2014-December/000071.html.