Delay-Aware Aware Flow Scheduling In Low Latency Enterprise Datacenter Networks: Modeling and Performance Analysis
Abstract: Real-time time interactive application workloads (e.g., Web search, social networking, and so on) appear in the form of a large number of mini requests and responses flowing over the datacenters’ networks. They end up being sewed all together to constitute a user-requested requested task or computation (e.g., display a complete Facebook timeline). Applications as such strictly impose low latency flow completion, since the service’s quality is decreed by quick aggregation of responses to the largest possible fraction of re requests quests and their delivery back to the user. This paper presents a deadline deadline-aware aware flow scheduling (DAFS). In addition to reducing the average flow completion time (FCT), DAFS aims at decreasing the deadline mismatch and blocking probabilities, hence improving improvi the average application throughput. An analytical queuing model is formulated herein to capture the datacenter’s network dynamics and evaluate its performance when operating under DAFS. The model is validated through extensive simulations whose results also show that DAFS outperforms existing multi-queue-based based priority mechanisms by 52% in terms of the average FCT and a range of 7%–29% 29% in terms of the average throughput.