Ahmed Elbery, Yi Lian, Geng Li
{"title":"Toward Fair and Efficient Congestion Control: Machine Learning Aided Congestion Control (MLACC)","authors":"Ahmed Elbery, Yi Lian, Geng Li","doi":"10.1145/3600061.3603275","DOIUrl":null,"url":null,"abstract":"Emerging inter-datacenter applications require massive loads of data transfer which makes them sensitive to packet drops, high latency, and fair resource sharing. However, current congestion control (CC) protocols do not guarantee the optimal outcome of these metrics. In this paper, we introduce a new CC technique, Machine Learning Aided Congestion Control (MLACC), that combines heuristics and machine learning (ML) to improve these three network metrics. The proposed technique achieves a high level of fairness, minimum latency, and minimum drop rate. ML is utilized to estimate the ratio of the available bandwidth of the bottleneck link while the heuristic uses this ratio to enable end-points to cooperatively limit the shared bottleneck link utilization under a predefined threshold in order to minimize latency and drop rate. The key to achieving the desired fairness is using the gradient of the link utilization to control the sending rate. We compared MLACC to BBR (which is at least on par with the state-of-the-art ML-based techniques) as a base case in different network settings. The results show that MLACC can achieve lower and more stable end-to-end latency (25% to 52% latency saving). It also significantly reduces packet drop rates while attaining a higher fairness level. The only cost for these advantages is a small throughput reduction of less than 3.5%.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th Asia-Pacific Workshop on Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3600061.3603275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

新兴的跨数据中心应用程序需要大量的数据传输负载,这使得它们对丢包、高延迟和公平的资源共享非常敏感。然而,当前的拥塞控制(CC)协议并不能保证这些指标的最佳结果。在本文中,我们介绍了一种新的CC技术,机器学习辅助拥塞控制(MLACC),它结合了启发式和机器学习(ML)来改进这三个网络指标。所提出的技术实现了高水平的公平性、最小的延迟和最小的丢包率。ML用于估计瓶颈链路可用带宽的比率,启发式使用该比率使端点能够在预定义的阈值下合作限制共享瓶颈链路的利用率,以最小化延迟和丢弃率。实现期望的公平性的关键是利用链路利用率的梯度来控制发送速率。我们将MLACC与BBR(至少与最先进的基于ml的技术相当)作为不同网络设置的基本情况进行了比较。结果表明,MLACC可以实现更低、更稳定的端到端延迟(延迟节省25% ~ 52%)。它还显著降低了丢包率,同时获得了更高的公平性。这些优势的唯一代价是吞吐量减少了不到3.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Toward Fair and Efficient Congestion Control: Machine Learning Aided Congestion Control (MLACC)
Emerging inter-datacenter applications require massive loads of data transfer which makes them sensitive to packet drops, high latency, and fair resource sharing. However, current congestion control (CC) protocols do not guarantee the optimal outcome of these metrics. In this paper, we introduce a new CC technique, Machine Learning Aided Congestion Control (MLACC), that combines heuristics and machine learning (ML) to improve these three network metrics. The proposed technique achieves a high level of fairness, minimum latency, and minimum drop rate. ML is utilized to estimate the ratio of the available bandwidth of the bottleneck link while the heuristic uses this ratio to enable end-points to cooperatively limit the shared bottleneck link utilization under a predefined threshold in order to minimize latency and drop rate. The key to achieving the desired fairness is using the gradient of the link utilization to control the sending rate. We compared MLACC to BBR (which is at least on par with the state-of-the-art ML-based techniques) as a base case in different network settings. The results show that MLACC can achieve lower and more stable end-to-end latency (25% to 52% latency saving). It also significantly reduces packet drop rates while attaining a higher fairness level. The only cost for these advantages is a small throughput reduction of less than 3.5%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信