In modern datacenters, the most common method to solve the network latency problem is to minimize flow completion time during the transmission process. Following the soft real-time nature, the optimization of transpor...In modern datacenters, the most common method to solve the network latency problem is to minimize flow completion time during the transmission process. Following the soft real-time nature, the optimization of transport latency is relaxed to meet a flow's deadline in deadline-sensitive services. However, none of existing deadline-sensitive protocols consider deadline as a constraint condition of transmission.They can only simplify the objective of meeting a flow's deadline as a deadline-aware mechanism by assigning a higher priority for tight-deadline constrained flows to finish the transmission as soon as possible, which results in an unsatisfactory effect in the condition of high fan-in degree. It drives us to take a step back and rethink whether minimizing flow completion time is the optimal way in meeting flow's deadline. In this paper, we focus on the design of a soft real-time transport protocol with deadline constraint in datacenters and present a flow-based deadline scheduling scheme for datacenter networks(FBDS).FBDS makes the unilateral deadline-aware flow transmission with priority transform into a compound centralized single-machine deadlinebased flow scheduling decision. In addition, FBDS blocks the flow sets and postpones some flows with extra time until their deadlines to make room for the new arriving flows in order to improve the deadline meeting rate. Our simulation resultson flow completion time and deadline meeting rate reveal the potential of FBDS in terms of a considerable deadline-sensitive transport protocol for deadline-sensitive interactive services.展开更多
Decreasing the flow completion time(FCT) and increasing the throughput are two fundamental targets in datacenter networks(DCNs), but current mechanisms mostly focus on one of the problems. In this paper, we propose OF...Decreasing the flow completion time(FCT) and increasing the throughput are two fundamental targets in datacenter networks(DCNs), but current mechanisms mostly focus on one of the problems. In this paper, we propose OFMPC, an Open Flow based Multi Path Cooperation framework, to decrease FCT and increase the network throughput. OFMPC partitions the end-to-end transmission paths into two classes, which are low delay paths(LDPs) and high throughput paths(HTPs), respectively. Short flows are assigned to LDPs to avoid long queueing delay, while long flows are assigned to HTPs to guarantee their throughput. Meanwhile, a dynamic scheduling mechanism is presented to improve network efficiency. We evaluate OFMPC in Mininet emulator and a testbed, and the experimental results show that OFMPC can effectively decrease FCT. Besides, OFMPC also increases the throughput up to more than 84% of bisection bandwidth.展开更多
基金supported in part by the Fundamental Research Funds for the Central Universities under Grant No.2014JBM011 and No.2014YJS021in part by NSFC under Grant No.62171200,61422101,and 62132017+2 种基金in part by the Ph.D.Programs Foundation of MOE of China under Grant No.20130009110014in part by "NCET" under Grant No.NCET-12-0767in part by China Postdoctoral Science Foundation under Grant No.2015M570028,2015M580970
文摘In modern datacenters, the most common method to solve the network latency problem is to minimize flow completion time during the transmission process. Following the soft real-time nature, the optimization of transport latency is relaxed to meet a flow's deadline in deadline-sensitive services. However, none of existing deadline-sensitive protocols consider deadline as a constraint condition of transmission.They can only simplify the objective of meeting a flow's deadline as a deadline-aware mechanism by assigning a higher priority for tight-deadline constrained flows to finish the transmission as soon as possible, which results in an unsatisfactory effect in the condition of high fan-in degree. It drives us to take a step back and rethink whether minimizing flow completion time is the optimal way in meeting flow's deadline. In this paper, we focus on the design of a soft real-time transport protocol with deadline constraint in datacenters and present a flow-based deadline scheduling scheme for datacenter networks(FBDS).FBDS makes the unilateral deadline-aware flow transmission with priority transform into a compound centralized single-machine deadlinebased flow scheduling decision. In addition, FBDS blocks the flow sets and postpones some flows with extra time until their deadlines to make room for the new arriving flows in order to improve the deadline meeting rate. Our simulation resultson flow completion time and deadline meeting rate reveal the potential of FBDS in terms of a considerable deadline-sensitive transport protocol for deadline-sensitive interactive services.
基金supported by the State Key Development Program for Basic Research of China under Grant No.2012CB315806the National Natural Science Foundation of China under Grant Nos.61103225 and 61379149+1 种基金Jiangsu Province Natural Science Foundation of China under Grant No.BK20140070Jiangsu Future Networks Innovation Institute Prospective Research Project on Future Networks under Grant No.BY2013095-1-06
文摘Decreasing the flow completion time(FCT) and increasing the throughput are two fundamental targets in datacenter networks(DCNs), but current mechanisms mostly focus on one of the problems. In this paper, we propose OFMPC, an Open Flow based Multi Path Cooperation framework, to decrease FCT and increase the network throughput. OFMPC partitions the end-to-end transmission paths into two classes, which are low delay paths(LDPs) and high throughput paths(HTPs), respectively. Short flows are assigned to LDPs to avoid long queueing delay, while long flows are assigned to HTPs to guarantee their throughput. Meanwhile, a dynamic scheduling mechanism is presented to improve network efficiency. We evaluate OFMPC in Mininet emulator and a testbed, and the experimental results show that OFMPC can effectively decrease FCT. Besides, OFMPC also increases the throughput up to more than 84% of bisection bandwidth.
