Load Balancing With Deadline-Driven Parallel Data Transmission in Data Center Networks

被引:12
作者
Zhang, Tao [1 ]
Huang, Ran [2 ,3 ]
Hu, Yuanzhen [1 ]
Li, Yangfan [4 ]
Zou, Shaojun [1 ]
Zhang, Qianqiang [1 ]
Liu, Xin
Ruan, Chang [5 ]
机构
[1] Changsha Univ, Sch Comp Engn & Appl Math, Changsha 410022, Peoples R China
[2] Changsha Univ, Hunan Prov Key Lab Ind Internet Technol & Secur, Changsha 410022, Peoples R China
[3] Univ Sheffield, Dept Comp Sci, Sheffield S10 2TN, England
[4] Cent South Univ, Sch Comp Sci & Engn, Changsha 410083, Peoples R China
[5] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha 4100114, Peoples R China
基金
中国国家自然科学基金;
关键词
Data center network (DCN); deadline-aware; load balancing; soft real-time applications; FLOWS; TIME;
D O I
10.1109/JIOT.2022.3204908
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the explosive growth of the Internet of Things (IoT), an increasing amount of sensor data generated by soft real-time IoT applications has been moved to data centers for storage and data analysis. Large amounts of these data are required to be processed within a given deadline to ensure application performance. Therefore, meeting the transmission deadlines of data flows for soft real-time applications has always been crucial yet challenging to current data centers. Recent progress has demonstrated that adopting parallel data transmission over multipath data center network combining with effective load balancing can achieve a high bisection network bandwidth, thus speeding up the network transfer of data flows. Nevertheless, the deadline miss ratios (DMRs) of these flows are not lowered as expected since the existing load balancing schemes are naturally agnostic to the deadline requirement. They are either unable to reroute traffic flexibly or aimlessly reroute these deadline-restrained flows, regardless of their urgent levels and path conditions. To address these inefficiencies, we propose a deadline-aware load-balancing scheme, namely, DLB, which perceives the deadline requirements and helps the urgent flows to timely switch to those faster transmission paths to complete quickly. Specifically, DLB computes the urgent level for each flow in real time to judge if the switch needs to make proactive rerouting. When a flow is nonurgent, DLB does not proactively change its transmission path, leaving more available paths to those flows with higher urgent levels. When a flow becomes extremely urgent, it immediately switches to those light-loaded paths to finish its data transmission before its deadline as far as possible. Experimental results of NS2 simulations and real testbed implementations show that DLB reduces the DMRs by up to 50% compared to the state-of-the-art data center load-balancing schemes, while only induces trivial overhead during deployment.
引用
收藏
页码:1171 / 1191
页数:21
相关论文
共 62 条
[1]  
Alizadeh M, 2014, ACM SIGCOMM COMP COM, V44, P503, DOI [10.1145/2619239.2626316, 10.1145/2740070.2626316]
[2]   pFabric: Minimal Near-Optimal Datacenter Transport [J].
Alizadeh, Mohammad ;
Yang, Shuang ;
Sharif, Milad ;
Katti, Sachin ;
McKeown, Nick ;
Prabhakar, Balaji ;
Shenker, Scott .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :435-446
[3]   Data Center TCP (DCTCP) [J].
Alizadeh, Mohammad ;
Greenberg, Albert ;
Maltz, David A. ;
Padhye, Jitendra ;
Patel, Parveen ;
Prabhakar, Balaji ;
Sengupta, Sudipta ;
Sridharan, Murari .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) :63-74
[4]  
[Anonymous], 2013, P 12 ACM WORKSH HOT
[5]  
Bai W, 2020, IEEE INFOCOM SER, P2007, DOI [10.1109/INFOCOM41043.2020.9155280, 10.1109/infocom41043.2020.9155280]
[6]   Enabling ECN over Generic Packet Scheduling [J].
Bai, Wei ;
Chen, Kai ;
Chen, Li ;
Kim, Changhoon ;
Wu, Haitao .
PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES (CONEXT'16), 2016, :191-204
[7]   PIAS: Practical Information-Agnostic Flow Scheduling for Commodity Data Centers [J].
Bai, Wei ;
Chen, Li ;
Chen, Kai ;
Han, Dongsu ;
Tian, Chen ;
Wang, Hao .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (04) :1954-1967
[8]  
Benson T., 2010, P 10 ACM SIGCOMM C I, P267, DOI [DOI 10.1145/1879141.1879175, 10.1145/1879141.1879175]
[9]   Programming Protocol-Independent Packet Processors [J].
Bosshart, Pat ;
Daly, Dan ;
Gibb, Glen ;
Izzard, Martin ;
McKeown, Nick ;
Rexford, Jennifer ;
Schlesinger, Cole ;
Talayco, Dan ;
Vahdat, Amin ;
Varghese, George ;
Walker, David .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (03) :87-95
[10]   Per-packet Load-balanced, Low-Latency Routing for Clos-based Data Center Networks [J].
Cao, Jiaxin ;
Xia, Rui ;
Yang, Pengkun ;
Guo, Chuanxiong ;
Lu, Guohan ;
Yuan, Lihua ;
Zheng, Yixin ;
Wu, Haitao ;
Xiong, Yongqiang ;
Maltz, Dave .
PROCEEDINGS OF THE 2013 ACM INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES (CONEXT '13), 2013, :49-60