Data Center Dynamic Priority Multipath Scheduling Algorithm Based on SDN

doi:10.3969/j.issn.1006-2475.2020.07.005

Abstract

Abstract: With the development of cloud computing technology and distributed services, the “East-West” elephant flow in the data center has surged. This part of the elephant flow is prone to collisions due to improper scheduling, causing link congestion. This paper proposes a Dynamic Priority Multipath Scheduling algorithm (DPMS) based on Software-Defined Network (SDN). The algorithm develops an elephant flow and mouse flow scheduling model based on the characteristics of data center traffic, makes full use of redundant links between network nodes to improve resource utilization. Combined with the group table, the communication mode between the controller and the switch in the SDN architecture is optimized, and the packet processing delay is reduced. The experimental results show that DPMS improves network throughput and link utilization, reduces average flow completion time, and improves overall network performance compared with ECMP and Hedera scheduling strategies.

Key words: traffic scheduling, multipath transmission, software-defined network, data center network

CLC Number:

TP393

XIAO Jun-bi, CHENG Peng, TAN Li-zhuang, MENG Xiang-ze. Data Center Dynamic Priority Multipath Scheduling Algorithm Based on SDN[J]. Computer and Modernization, 2020, 0(07): 21-26.

References ［24］

［1］	BENSON T, ANAND A, AKELLA A, et al. Understanding data center traffic characteristics［J］. ACM SIGCOMM Computer Communication Review, 2010,40(1):92-99.
［2］	〖KG-*7〗 KANDULA S, SENGUPTA S, GREENBERG A, et al. The nature of data center traffic: Measurements & analysis［C］// Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement. 2009:202-208.
［3］	HU F, HAO Q, BAO K. A survey on software defined networking (SDN) and openflow: From concept to implementation［J］. IEEE Communications Surveys & Tutorials, 2014,16(4):2181-2206.
［4］	KIRKPATRICK K. Software-defined networking［J］. Communications of the ACM, 2013,56(9):16-19.
［5］	MCKEOWN N, ANDERSON T, BALAKRISHNAN H, et al. OpenFlow: Enabling innovation in campus networks［J］. ACM SIGCOMM Computer Communication Review, 2008,38(2):69-74.
［6］	ALFARES M, LOUKISSAS A, VAHDAT A, et al. A scalable, commodity data center network architecture［J］. ACM SIGCOMM Computer Communication Review, 2008,38(4):63-74.
［7］	ZHANG H, GUO X, YAN J, et al. SDN-based ECMP algorithm for data center networks［C］// 2014 IEEE Computers, Communications and IT Applications Conference. 2014:13-18.
［8］	ALFARES M, RADHAKRISHNAN S, RAGHAVAN B, et al. Hedera: Dynamic flow scheduling for data center networks［C］// Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation. 2010:281-296.
［9］	左青云,陈鸣,赵广松,等. 基于OpenFlow的SDN技术研究［J］. 软件学报, 2013(5):1078-1097.
［10］	CURTIS A R, MOGUL J C, TOURRILHES J, et al. DevoFlow: Scaling flow management for high-performance networks［J］. ACM SIGCOMM Computer Communication Review, 2011,41(4):254-265.
［11］	ZHANG Y X, CUI L, ZHANG Y, et al. A stable matching based elephant flow scheduling algorithm in data center networks［J］. Computer Networks, 2017,120(19):186-197.
［12］	MORI T, KAWAHARA R, NAITO S, et al. On the characteristics of Internet traffic variability: Spikes and elephants［J］. IEICE Transactions on Information and Systems, 2004,87(12):2644-2653.
［13］	ALIZADEH M, GREENBERG A, MALTZ D A, et al. Data center TCP (DCTCP)［J］. ACM SIGCOMM Computer Communication Review, 2010,40(4):63-74.
［14］	PHAAL P. sFlow Specification Version 5［M/OL］. ［2016-01-20］. http://sflow. org/sflow_version_5.txt.
［15］	韩慧芳,杨珂玲,张建军. Pareto分布中形状参数的估计问题［J］. 统计与决策, 2007(24):10-12.
［16］	陈月萍．连续型幂律分布的统计性质［D］．福州：福建师范大学， 2012．
［17］	TAN L Z, SU W, GAO S, et al. L4S: Low-speed software synergetic sampling and detecting long flow for data center network［C］// 2018 IEEE International Conference on Networking and Network Applications. 2018:169-174.
［18］	MORI T, UCHIDA M, KAWAHARA R, et al. Identifying elephant flows through periodically sampled packets［C］// Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement. 2004:115-120.
［19］	田雨.基于OpenFlow网络的大象流检测调度的研究［D］. 北京：北京工业大学， 2017.
［20］	MINRIK T, SUFLIARSKY J, TRUPL J, et al. 2013 9th international conference on network and service management(CNSM)［J］. Journal of Infection, 2013,34(1):91.
［21］	CHANG L, LIN X, QIN L, et al. Efficiently computing Top-K shortest path join［C］// International Conference on Extending Database Technology. 2015:133-144.
［22］	GAO Y Q, YU L. A power and performance aware routing algorithm for Fat tree networks［C］// IEEE International Conference on Big Data Security on Cloud. 2017:173-178.
［23］	ZHAO G, XU H, CHEN S, et al. Deploying default paths by joint optimization of flow table and group table in SDNs［C］// IEEE International Conference on Network Protocols. 2017:1-10.
［24］	LANTZ B， HELLER B， MCKEOWN N． A network in a laptop:Rapid prototyping for software-defined networks［C］// ACM SIGCOMM Workshop on Hot Topics in Networks． 2010:1-6.

[1]	CHEN Chen, ZHUANG Yi, GAO Zeng. QoE-driven High-availability Transmission Framework for SDN [J]. Computer and Modernization, 2023, 0(11): 62-68.
[2]	DAI Song, SUN Yan-tao, LIU Qiang, JIA Ze-qun, . Networking Method for SDMANET Based on Multi-mode Radio [J]. Computer and Modernization, 2020, 0(08): 82-88.
[3]	GENG Lan-lan1, SUN Yan-tao2, DAI Song1. A Topology Discovery Method for Software-defined Mobile Ad Hoc Networks [J]. Computer and Modernization, 2019, 0(09): 53-.
[4]	TIAN Ye1， SUN Yan-tao1,2， XIONG Ke1,2. A Semi-centralized SDN Routing Strategy in Data Center Network [J]. Computer and Modernization, 2018, 0(01): 95-101.
[5]	YIN Su-kai1, LIU Guang-jie1, LIU Wei-wei1, ZHAI Jiang-tao2, DAI Yue-wei1,2. Design of Multiple-flow Timing Channel in Software-defined [J]. Computer and Modernization, 2017, 0(4): 94-98,104.
[6]	ZHANG Chan， FENG Guojun， XIAO Yunbo. Study on Indices of DCN Structural Robustness [J]. Computer and Modernization, 2016, 0(5): 55-60.
[7]	ZHUANG Huai-dong, DU Qing-wei. A Method of Data Center Network Dynamic Traffic Scheduling Based on SDN [J]. Computer and Modernization, 2016, 251(07): 80-86.