PEQ: Scheduling Time-Sensitive Data-Center Flows using Weighted Flow Sizes and Deadlines

Document Type

Conference Proceeding

Publication Date

5-1-2020

Abstract

We propose a deadline-Aware flow scheduling scheme, called Preemptive Efficient Queuing (PEQ), which takes both the deadlines and sizes of the flows into account for efficient flow scheduling of flows in a data-center network in this paper. PEQ benefits from evaluating the deadlines and flow sizes of flows to improve application throughput. Our results show that PEQ outperforms the state-of-The-Art deadline-Aware transport schemes in terms of the application throughput and average flow completion time, under traffic with different deadline distributions. Results also show that PEQ yields a near-optimal application throughput in cases where short flows have long deadlines and long flows have strict deadlines. In other words, PEQ attains higher performance than the counterpart schemes on traffic with broader distribution of deadlines and flow sizes.

Identifier

85085684846 (Scopus)

ISBN

[9781728148465]

Publication Title

IEEE International Conference on High Performance Switching and Routing Hpsr

External Full Text Location

https://doi.org/10.1109/HPSR48589.2020.9098992

e-ISSN

23255609

ISSN

23255595

Volume

2020-May

This document is currently not available here.

Share

COinS