Reducing tail latency for multi-bottleneck in datacenter networks: A compound approach

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2024-11-23 DOI:10.1016/j.comnet.2024.110931
Yuxiang Zhang , Lin Cui , Fung Po Tso , Xiaolin Lei
{"title":"Reducing tail latency for multi-bottleneck in datacenter networks: A compound approach","authors":"Yuxiang Zhang ,&nbsp;Lin Cui ,&nbsp;Fung Po Tso ,&nbsp;Xiaolin Lei","doi":"10.1016/j.comnet.2024.110931","DOIUrl":null,"url":null,"abstract":"<div><div>The effectiveness of network congestion control fundamentally depends on the accuracy and granularity of congestion feedback. In datacenter networks, precise feedback is essential for achieving high performance. Most existing approaches use either Explicit Congestion Notification (ECN) or network delay (e.g., RTT) independently as congestion indicators. However, in multi-bottleneck networks, the limitations of these signals become more pronounced: ECN struggles with large cumulative end-to-end latency, while RTT lacks the precision needed to control queuing delays at individual hops. To address these challenges, we propose <em>Cocktail</em>, a simple yet effective transport protocol for datacenter networks that combines both ECN and RTT congestion signals to more effectively handle multi-bottleneck scenarios. By leveraging the ECN signal, <em>Cocktail</em> bounds per-hop queue lengths, enhancing its ability to control single-hop latency and prevent packet loss. Additionally, by estimating RTT, <em>Cocktail</em> effectively manages end-to-end delay, resulting in lower Flow Completion Time (FCT). Extensive experimental evaluations in Mininet demonstrate that <em>Cocktail</em> significantly reduces the average and 99th-percentile completion times for small flows by up to 20% and 29%, respectively, compared to current practices under production workloads.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110931"},"PeriodicalIF":4.4000,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624007631","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

The effectiveness of network congestion control fundamentally depends on the accuracy and granularity of congestion feedback. In datacenter networks, precise feedback is essential for achieving high performance. Most existing approaches use either Explicit Congestion Notification (ECN) or network delay (e.g., RTT) independently as congestion indicators. However, in multi-bottleneck networks, the limitations of these signals become more pronounced: ECN struggles with large cumulative end-to-end latency, while RTT lacks the precision needed to control queuing delays at individual hops. To address these challenges, we propose Cocktail, a simple yet effective transport protocol for datacenter networks that combines both ECN and RTT congestion signals to more effectively handle multi-bottleneck scenarios. By leveraging the ECN signal, Cocktail bounds per-hop queue lengths, enhancing its ability to control single-hop latency and prevent packet loss. Additionally, by estimating RTT, Cocktail effectively manages end-to-end delay, resulting in lower Flow Completion Time (FCT). Extensive experimental evaluations in Mininet demonstrate that Cocktail significantly reduces the average and 99th-percentile completion times for small flows by up to 20% and 29%, respectively, compared to current practices under production workloads.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
减少数据中心网络中多瓶颈的尾部延迟:一种复合方法
网络拥塞控制的有效性从根本上取决于拥塞反馈的准确性和粒度。在数据中心网络中,精确的反馈对于实现高性能至关重要。大多数现有的方法使用显式拥塞通知(ECN)或网络延迟(例如,RTT)独立作为拥塞指标。然而,在多瓶颈网络中,这些信号的局限性变得更加明显:ECN与巨大的累积端到端延迟作斗争,而RTT缺乏控制单个跳的排队延迟所需的精度。为了应对这些挑战,我们提出了鸡尾酒,这是一种简单而有效的数据中心网络传输协议,它结合了ECN和RTT拥塞信号,以更有效地处理多瓶颈场景。通过利用ECN信号,Cocktail限制每跳队列长度,增强其控制单跳延迟和防止数据包丢失的能力。此外,通过估计RTT, Cocktail有效地管理了端到端延迟,从而降低了流完井时间(FCT)。Mininet的大量实验评估表明,与目前的生产工作量相比,Cocktail显著减少了小流量的平均完井时间和99百分位完井时间,分别减少了20%和29%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
HawkEye: An end-host method to detect the Low-rate Denial-of-Service attack of cross-traffic over bottleneck links Editorial Board DUdetector: A dual-granularity unsupervised model for network anomaly detection LPPAC: Lightweight privacy-preserving distributed payments with access control Cooperation-based server deployment strategy in mobile edge computing system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1