With the rapid development of data center network, the traditional traffic scheduling method can easily cause problems such as link congestion and load imbalance. Therefore, this paper proposes a novel dynamic flow scheduling algorithm GA-ACO (Genetic Algorithm and Ant COlony algorithms). GA-ACO algorithm obtains the global perspective of the network under the SDN (Software defined network) architecture. It then calculates the global optimal path for the elephant flow on the congestion link, and reroutes it. Extensive experiments have been executed to evaluate the performance of the proposed GA-ACO algorithm. The simulation results show that, in comparison with ECMP and ACO-SDN algorithm, GA-ACO can not only reduce the maximum link utilization, but also improve the bandwidth effectively.
GangD., ZhenghuG. and WangH., Characteristics research on modern data center network[J], Journal of Computer Research and Development51(2) (2014), 395–407.
2.
YuepingC. and ChangpingW., Software defined data center network with hybrid routing[J], Journal on Communications37(04) (2016), 44–52.
3.
CurtisA.R., KimW. and YalagandulaP.M., Low-overhead datacenter traffic management using end-host-based elephant detection[C]//, Proc of IEEE INFOCOM (2011), pp. 1629–1637.
4.
GreenbergA., LahiriP., MaltzD.A., et al., Towards a next generation data center architecture, scalability and commoditization[C]// pp, ACM Workshop on Programmable Routers for Extensible Services of Tomorrow ACM (2008), 57–62.
5.
ChenK., SinglaA., SinghA., et al., OSA: An optical switching architecture for data center networks with unprecedented flexibility[J], IEEE/ACM Transactions on Networking22(2) (2014), 498–511.
6.
WangG., AndersenD.G., KaminskyM., et al., C-Through, part-time optics in data centers[C]//, Acm Sigcomm Conference, ACM2010.
7.
GuoC., LuG., LiD., et al., BCube, A High Performance, Server-centric Network Architecture for Modular Data Centers[J], 2009.
8.
GreenbergA., HamiltonJ.R., JainN., et al., VL2: A scalable and flexible data center network[J], Communications of the ACM54(3) (2009), 95–104.
9.
Escudero-SahuquilloJ., GarciaP.J., QuilesF.J., et al., A new proposal to deal with congestion in InfiniBand-based fat-trees[J], Journal of Parallel & Distributed Computing74(1) (2014), 1802–1819.
10.
HoppsC., Analysis of an Equal-Cost Multi-Path Algorithm[M]. RFC IETF, RFC, (2992), 2000.
11.
KandulaS., SenguptaS., GreenbergA., et al., The nature of data center traffic, measurements & analysis[C]// pp, Proc of ACM SIGCOMM Conference on Internet Measurement (2009), 202–208.
12.
BensonT., AkellaA. and MaltzD.A., Network traffic characteristics of data centers in the wild [C]//, Proc of the 10th ACM SIGCOMM Conference on Internet Measurement (2010), pp. 267–280.
13.
MckeownN., AndersonT., BalakrishnanH., et al., OpenFlow: Enabling innovation in campus networks[J], ACM SIGCOMM Computer Communication Review38(2) (2008), 69–74.
14.
Al-FaresM., RadhakrishnanS., RaghavanB., et al., Hedera, dynamic flow scheduling for data center networks[C]//, Usenix Symposium on Networked Systems Design and Implementation, NSDI2010 (2010), 281–296.
15.
TangF., YangL.T., TangC., et al., A dynamical and load-balanced flow scheduling approach for big data centers in clouds[J], IEEE Transactions on Cloud Computing (2016), 1.
16.
ChakrabortyS. and ChenC., A low-latency multipath routing without elephant flow detection for data centers[C]// pp, IEEE, International Conference on High Performance Switching and Routing IEEE (2016), 49–54.
17.
ZhangY., CuiL. and ZhangY., A stable matching based elephant flow scheduling algorithm in data center networks[J], Computer Networks120 (2017), 186–197.
18.
ZhangH., TangF. and BarolliL., Efficient flow detection and scheduling for SDN-based big data centers[J], Journal of Ambient Intelligence & Humanized Computing (2018), 1–12.
19.
WeifeiZ., JulongL. and YuxiangH., SDN based multipath flow scheduling mechanism[J],), Application Research of Computers35(320(06) (2018), 223–227.
20.
HonghuiL., GuangY., HailiangL., XueliangF. and ZhijunS., Flow scheduling of elephant flows in SDN data center network based on ant colony algorithm[J/OL], 1–7 [-05-31], Application Research of Computers (2019).
21.
HollandJ.H., Adaptation in Natural and Artificial System[M], Ann Arbor University of Michigan Press, 1975.
22.
HaipinD., XiangyinZ. and ChunfangX., Bio-inspired Computing[M], Beijing, Science Press, 2011.
23.
LantzB., HellerB. and MckeownN., A network in a laptop, rapid prototyping for software-defined networks[C]// ACM Workshop on Hot Topics in Networks HOTNETS 2010, Monterey, CA, USA – October. DBLP, 2010, pp. 1–6.
24.
GiotisK., ArgyropoulosC., AndroulidakisG., et al., Combining OpenFlow and sFlow for an effective and scalable anomaly detection and mitigation mechanism on SDN environments [J], Computer Networks62(5) (2014), 122–136.
25.
Al-FaresM., LoukissasA. and VahdatA., A scalable, commodity data center network architecture[C]//Proc of ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2008, pp. 63–74.
26.
Al-FaresM., RadhakrishnanS., RaghavanB., et al., Hedera, dynamic flow scheduling for data center networks[C]//, Usenix Symposium on Networked Systems Design and Implementation, NSDI2010 (2010), 281–296.
27.
WentaoW., FangZ., LingxiaW., et al., Design and implementation of flow scheduling mechanism based on SDN for data center network[J], Journal of South-Central University for Nationalities (Nat, Sci Edition)35(03) (2016), 135–140.
28.
ZhihuaL., WenG., ChunmingW. and YongyanL., Data center network flow scheduling based on DPSO algorithm[J], Acta Electronica Sinica44(09) (2016), 2197–2202.
