An Adaptable and Agnostic Flow Scheduling Approach for Data Center Networks

Cloud applications have reshaped the model of services and infrastructure of the Internet. Search engines, social networks, content delivery and retail and e-commerce sites belong to this group of applications. An important element in the architecture of data centers where these applications run is the communication infrastructure, commonly known as data center networks (DCNs). A critical challenge DCNs have to address is the processing of the traffic of cloud applications, which due to its properties is essentially different to the traffic of other Internet applications. In order to improve the responsiveness and throughput of applications, DCNs should be able to prioritize short flows (a few KB) over long flows (several MB). However, given the time and space variations the traffic presents, the information about flow sizes is not available in advance in order to plan the flow scheduling. In this paper, we present an adaptable mechanism called Adaptable Workload-Agnostic Flow Scheduling (AWAFS). It is an adaptable approach that can adjust in an agnostic way the scheduling configuration of DCN forwarding devices. This agnostic adjustment contributes to reduce the Flow Completion Time (FCT) of those short flows, representing around 85 Our evaluation results based on simulation show that AWAFS can reduce the average FCT of short flows between 16.9 existing agnostic non-adaptable solution, without inducing starvation on long flows. Indeed, it can provide improvements as high as 39 Additionally, AWAFS can improve the FCT for short flows in scenarios with high heterogeneity in the traffic present in the network, with a reduction up to 5 for the average FCT and 15

READ FULL TEXT
research
11/15/2019

Methods for Predicting Behavior of Elephant Flows in Data Center Networks

Several Traffic Engineering (TE) techniques based on SDN (Software-defin...
research
06/26/2020

QCluster: Clustering Packets for FlowScheduling

Flow scheduling is crucial in data centers, as it directly influences us...
research
02/11/2018

Stochastic Non-preemptive Co-flow Scheduling with Time-Indexed Relaxation

Co-flows model a modern scheduling setting that is commonly found in a v...
research
05/12/2019

Routing and Scheduling of Network Flows with Deadlines and Discrete Capacity Allocation

Joint scheduling and routing of data flows with deadline constraints in ...
research
07/29/2013

RepFlow: Minimizing Flow Completion Times with Replicated Flows in Data Centers

Short TCP flows that are critical for many interactive applications in d...
research
08/20/2018

Towards Fine Grained Network Flow Prediction

One main challenge for the design of networks is that traffic load is no...
research
08/25/2021

A Case for Sampling Based Learning Techniques in Coflow Scheduling

Coflow scheduling improves data-intensive application performance by imp...

Please sign up or login with your details

Forgot password? Click here to reset