DENA: An Intelligent Dynamic Flow Scheduling for Rate Adjustment in Green DCNs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We propose DENA as a deep reinforcement learning (DRL) based energy-efficient algorithm in the data center. To achieve the goal, DENA adjusts the transmission rate for each flow with deadlines and reduce the flow completion time (FCT) when the paths of flows are pre-given. Moreover, DENA includes a neural network classifier and a DRL system (DS). Accordingly, classifier separates the mice and elephant flows, then directly transfers the mice flows to avoid latency, while DS detects the interval of the most significant energy consumption density as a critical interval to schedule elephant flows. Besides, we apply deep deterministic policy gradient to DS with the advantage of an optimal base solution to enhance the accuracy of exploration. To the best of our knowledge, we are the first to use DRL for the rate adjustment. Our results show that besides saving energy, DENA reduces FCT for elephant flows workload 4.12%, data mining 1.04% and Hadoop 3.8%.

Original languageEnglish
Title of host publicationProceedings of the 44th Annual IEEE Conference on Local Computer Networks, LCN 2019
EditorsKarl Andersson, Hwee-Pink Tan, Sharief Oteafy
PublisherIEEE Computer Society
Pages234-237
Number of pages4
ISBN (Electronic)9781728110288
DOIs
StatePublished - Oct 2019
Externally publishedYes
Event44th Annual IEEE Conference on Local Computer Networks, LCN 2019 - Osnabruck, Germany
Duration: 14 Oct 201917 Oct 2019

Publication series

NameProceedings - Conference on Local Computer Networks, LCN
Volume2019-October

Conference

Conference44th Annual IEEE Conference on Local Computer Networks, LCN 2019
Country/TerritoryGermany
CityOsnabruck
Period14/10/1917/10/19

Fingerprint

Dive into the research topics of 'DENA: An Intelligent Dynamic Flow Scheduling for Rate Adjustment in Green DCNs'. Together they form a unique fingerprint.

Cite this