基于私有链路深度强化学习的SD-DCN混合流调度

Jinjie Lu, Waixi Liu, Yinghao Zhu, Sen Ling, Zhitao Chen, Jiaqi Zeng
{"title":"基于私有链路深度强化学习的SD-DCN混合流调度","authors":"Jinjie Lu, Waixi Liu, Yinghao Zhu, Sen Ling, Zhitao Chen, Jiaqi Zeng","doi":"10.1109/MSN50589.2020.00071","DOIUrl":null,"url":null,"abstract":"In software-defined datacenter networks, there are bandwidth-demanding elephant flows without deadline and delay-sensitive mice flows with strict deadline. They compete with each other for limited network resources, and how to effectively schedule such mix-flow is a huge challenge. We propose DRL-PLink (deep reinforcement learning with private link) that combines software-defined network and deep reinforcement learning (DRL) to schedule mix-flow. It divides the link bandwidth and establishes some corresponding private links for different types of flows respectively to isolate them. DRL is used to adaptively allocate bandwidth resources for these private links. Furthermore, DRL-PLink introduces Clipped Double Q-learning and parameter exploration NoisyNet technology to improve the scheduling policy for overestimated value estimates and action exploration problems in DRL. The simulation results show that DRL-PLink can effectively schedule mix-flow. Compared with ECMP and pFabric, the average flow completion time of DRL-PLink has decreased by 68.87% and 52.18% respectively. At the same time, it maintains a high deadline meet rate (>96.6%) close to pFabric and Karuna very much.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scheduling mix-flow in SD-DCN based on Deep Reinforcement Learning with Private Link\",\"authors\":\"Jinjie Lu, Waixi Liu, Yinghao Zhu, Sen Ling, Zhitao Chen, Jiaqi Zeng\",\"doi\":\"10.1109/MSN50589.2020.00071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In software-defined datacenter networks, there are bandwidth-demanding elephant flows without deadline and delay-sensitive mice flows with strict deadline. They compete with each other for limited network resources, and how to effectively schedule such mix-flow is a huge challenge. We propose DRL-PLink (deep reinforcement learning with private link) that combines software-defined network and deep reinforcement learning (DRL) to schedule mix-flow. It divides the link bandwidth and establishes some corresponding private links for different types of flows respectively to isolate them. DRL is used to adaptively allocate bandwidth resources for these private links. Furthermore, DRL-PLink introduces Clipped Double Q-learning and parameter exploration NoisyNet technology to improve the scheduling policy for overestimated value estimates and action exploration problems in DRL. The simulation results show that DRL-PLink can effectively schedule mix-flow. Compared with ECMP and pFabric, the average flow completion time of DRL-PLink has decreased by 68.87% and 52.18% respectively. At the same time, it maintains a high deadline meet rate (>96.6%) close to pFabric and Karuna very much.\",\"PeriodicalId\":447605,\"journal\":{\"name\":\"2020 16th International Conference on Mobility, Sensing and Networking (MSN)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 16th International Conference on Mobility, Sensing and Networking (MSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSN50589.2020.00071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN50589.2020.00071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在软件定义的数据中心网络中,存在没有截止日期的带宽要求高的大象流和具有严格截止日期的延迟敏感的老鼠流。它们相互竞争有限的网络资源,如何有效地调度这种混合流是一个巨大的挑战。我们提出了DRL- plink(带私有链接的深度强化学习),它结合了软件定义网络和深度强化学习(DRL)来调度混合流。它对链路带宽进行划分,并为不同类型的流分别建立相应的私有链路,实现流间的隔离。DRL用于自适应地为私有链路分配带宽资源。此外,DRL- plink引入了Clipped Double Q-learning和参数探索NoisyNet技术,改进了DRL中针对高估值估计和动作探索问题的调度策略。仿真结果表明,DRL-PLink可以有效地调度混合流。与ECMP和pFabric相比,DRL-PLink的平均流程完成时间分别缩短了68.87%和52.18%。同时保持着与pFabric和Karuna非常接近的高截止期完成率(>96.6%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling mix-flow in SD-DCN based on Deep Reinforcement Learning with Private Link
In software-defined datacenter networks, there are bandwidth-demanding elephant flows without deadline and delay-sensitive mice flows with strict deadline. They compete with each other for limited network resources, and how to effectively schedule such mix-flow is a huge challenge. We propose DRL-PLink (deep reinforcement learning with private link) that combines software-defined network and deep reinforcement learning (DRL) to schedule mix-flow. It divides the link bandwidth and establishes some corresponding private links for different types of flows respectively to isolate them. DRL is used to adaptively allocate bandwidth resources for these private links. Furthermore, DRL-PLink introduces Clipped Double Q-learning and parameter exploration NoisyNet technology to improve the scheduling policy for overestimated value estimates and action exploration problems in DRL. The simulation results show that DRL-PLink can effectively schedule mix-flow. Compared with ECMP and pFabric, the average flow completion time of DRL-PLink has decreased by 68.87% and 52.18% respectively. At the same time, it maintains a high deadline meet rate (>96.6%) close to pFabric and Karuna very much.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信