An Adaptable and Agnostic Flow Scheduling Approach for Data Center Networks
Sergio Armando Guti\'errez, Juan Felipe Botero, John Willian Branch

TL;DR
This paper introduces AWAFS, an adaptable, workload-agnostic flow scheduling mechanism for data center networks that improves flow completion times for cloud applications without requiring prior traffic knowledge.
Contribution
It proposes a novel adaptable and agnostic flow scheduling approach, AWAFS, that dynamically adjusts to traffic variations to optimize flow completion times in data center networks.
Findings
Reduces average FCT of short flows by up to 45.2%.
Improves FCT for long flows by up to 39%.
Effective in high heterogeneity traffic scenarios.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Software-Defined Networks and 5G · Caching and Content Delivery
