BFC+: Analysis and Improvement of the Congestion Control Algorithm BFC

Ketong Wu
{"title":"BFC+: Analysis and Improvement of the Congestion Control Algorithm BFC","authors":"Ketong Wu","doi":"10.1109/AINIT59027.2023.10212521","DOIUrl":null,"url":null,"abstract":"BFC is a per-flow per-hop congestion control method published in NSDI in 2022. BFC utilizes router support for multiple queues to perform per-flow per-hop level traffic scheduling within the network to maximize link utilization without requiring endpoint participation. A necessary condition for BFC to perform optimally is that routers must have sufficient buffer space and be able to truly isolate multiple flows within the same router. However, our experiments found that BFC's queue allocation algorithm cannot always effectively isolate multiple flows. BFC determines whether a queue is available by checking if the queue is empty, but in actual networks, it is common for queues to be empty during the absence of congestion or in the early stages of congestion. This can mistakenly allocate multiple flows to the same queue, causing BFC's scheduling ability to not perform optimally. This paper solves this problem and proposes an improved method called BFC+. Our experiments show that compared to BFC, BFC+'s queue allocation is more reasonable and has better performance.","PeriodicalId":276778,"journal":{"name":"2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINIT59027.2023.10212521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

BFC is a per-flow per-hop congestion control method published in NSDI in 2022. BFC utilizes router support for multiple queues to perform per-flow per-hop level traffic scheduling within the network to maximize link utilization without requiring endpoint participation. A necessary condition for BFC to perform optimally is that routers must have sufficient buffer space and be able to truly isolate multiple flows within the same router. However, our experiments found that BFC's queue allocation algorithm cannot always effectively isolate multiple flows. BFC determines whether a queue is available by checking if the queue is empty, but in actual networks, it is common for queues to be empty during the absence of congestion or in the early stages of congestion. This can mistakenly allocate multiple flows to the same queue, causing BFC's scheduling ability to not perform optimally. This paper solves this problem and proposes an improved method called BFC+. Our experiments show that compared to BFC, BFC+'s queue allocation is more reasonable and has better performance.
BFC+:拥塞控制算法BFC的分析与改进
BFC是NSDI于2022年发布的一种逐流逐跳拥塞控制方法。BFC利用路由器对多个队列的支持,在网络中执行每流每跳级别的流量调度,以最大限度地提高链路利用率,而不需要端点参与。BFC实现最佳性能的必要条件是路由器必须有足够的缓冲空间,并且能够在同一路由器内真正隔离多个流。然而,我们的实验发现,BFC的队列分配算法并不能总是有效地隔离多个流。BFC通过检查队列是否为空来确定队列是否可用,但在实际网络中,在没有拥塞或拥塞的早期阶段,队列通常是空的。这可能会错误地将多个流分配到同一个队列,导致BFC的调度能力不能最佳地执行。本文解决了这一问题,提出了一种改进的BFC+方法。实验表明,与BFC相比,BFC+的队列分配更加合理,具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信