交通拥堵控制的故障诊断解决方案

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Van Tong , Sami Souihi , Hai Anh Tran , Abdelhamid Mellouk
{"title":"交通拥堵控制的故障诊断解决方案","authors":"Van Tong ,&nbsp;Sami Souihi ,&nbsp;Hai Anh Tran ,&nbsp;Abdelhamid Mellouk","doi":"10.1016/j.jnca.2024.103923","DOIUrl":null,"url":null,"abstract":"<div><p>The Internet has existed since the 1970s as a means of data exchange between network devices in small networks. In the early stage, there was a small number of devices, but today there is an ever-increasing number of devices, leading to congestion in the network. Therefore, congestion control has attracted so much attention in the academic community and the industry for the past 30 years. Recently, Google has developed BBR (Bottleneck Bandwidth and Round-Trip Time), a rate-based congestion control algorithm. BBR controls transmission rates based on delivery rate and round-trip time (RTT). However, such a static congestion control algorithm (e.g., BBR, etc.) cannot achieve high performance in various network conditions (e.g., low bandwidth, etc.). Concretely, these static algorithms cannot adapt to the dynamic changes of the network environment. Therefore, in this paper, we propose an adaptive algorithm (called ABBR) for congestion control in next-generation networks. ABBR takes into account the reinforcement learning algorithm to learn relevant policies to change the transmission rate corresponding to each congestion control algorithm to optimize long-term performance. The experimental results show that our proposal can achieve good performance in terms of throughput, RTT, and fairness compared to the benchmarks.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"229 ","pages":"Article 103923"},"PeriodicalIF":7.7000,"publicationDate":"2024-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Troubleshooting solution for traffic congestion control\",\"authors\":\"Van Tong ,&nbsp;Sami Souihi ,&nbsp;Hai Anh Tran ,&nbsp;Abdelhamid Mellouk\",\"doi\":\"10.1016/j.jnca.2024.103923\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The Internet has existed since the 1970s as a means of data exchange between network devices in small networks. In the early stage, there was a small number of devices, but today there is an ever-increasing number of devices, leading to congestion in the network. Therefore, congestion control has attracted so much attention in the academic community and the industry for the past 30 years. Recently, Google has developed BBR (Bottleneck Bandwidth and Round-Trip Time), a rate-based congestion control algorithm. BBR controls transmission rates based on delivery rate and round-trip time (RTT). However, such a static congestion control algorithm (e.g., BBR, etc.) cannot achieve high performance in various network conditions (e.g., low bandwidth, etc.). Concretely, these static algorithms cannot adapt to the dynamic changes of the network environment. Therefore, in this paper, we propose an adaptive algorithm (called ABBR) for congestion control in next-generation networks. ABBR takes into account the reinforcement learning algorithm to learn relevant policies to change the transmission rate corresponding to each congestion control algorithm to optimize long-term performance. The experimental results show that our proposal can achieve good performance in terms of throughput, RTT, and fairness compared to the benchmarks.</p></div>\",\"PeriodicalId\":54784,\"journal\":{\"name\":\"Journal of Network and Computer Applications\",\"volume\":\"229 \",\"pages\":\"Article 103923\"},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2024-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Network and Computer Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1084804524001000\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804524001000","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

互联网作为小型网络设备之间的数据交换手段,自 20 世纪 70 年代起就已经存在。早期设备数量较少,但如今设备数量越来越多,导致网络拥塞。因此,拥塞控制在过去 30 年里备受学术界和业界的关注。最近,谷歌开发了基于速率的拥塞控制算法 BBR(瓶颈带宽和往返时间)。BBR 根据传输速率和往返时间 (RTT) 控制传输速率。然而,这种静态拥塞控制算法(如 BBR 等)无法在各种网络条件(如低带宽等)下实现高性能。具体来说,这些静态算法无法适应网络环境的动态变化。因此,我们在本文中提出了一种用于下一代网络拥塞控制的自适应算法(称为 ABBR)。ABBR 考虑了强化学习算法,通过学习相关策略来改变每种拥塞控制算法对应的传输速率,从而优化长期性能。实验结果表明,与基准相比,我们的建议能在吞吐量、RTT 和公平性方面取得良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Troubleshooting solution for traffic congestion control

The Internet has existed since the 1970s as a means of data exchange between network devices in small networks. In the early stage, there was a small number of devices, but today there is an ever-increasing number of devices, leading to congestion in the network. Therefore, congestion control has attracted so much attention in the academic community and the industry for the past 30 years. Recently, Google has developed BBR (Bottleneck Bandwidth and Round-Trip Time), a rate-based congestion control algorithm. BBR controls transmission rates based on delivery rate and round-trip time (RTT). However, such a static congestion control algorithm (e.g., BBR, etc.) cannot achieve high performance in various network conditions (e.g., low bandwidth, etc.). Concretely, these static algorithms cannot adapt to the dynamic changes of the network environment. Therefore, in this paper, we propose an adaptive algorithm (called ABBR) for congestion control in next-generation networks. ABBR takes into account the reinforcement learning algorithm to learn relevant policies to change the transmission rate corresponding to each congestion control algorithm to optimize long-term performance. The experimental results show that our proposal can achieve good performance in terms of throughput, RTT, and fairness compared to the benchmarks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Network and Computer Applications
Journal of Network and Computer Applications 工程技术-计算机:跨学科应用
CiteScore
21.50
自引率
3.40%
发文量
142
审稿时长
37 days
期刊介绍: The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.
×
引用
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学术官方微信