TCP-PPCC:在线学习的拥塞控制策略

Jing Li, Yuyao Guan, Pengpeng Ding, Shiwei Wang
{"title":"TCP-PPCC:在线学习的拥塞控制策略","authors":"Jing Li, Yuyao Guan, Pengpeng Ding, Shiwei Wang","doi":"10.23919/APNOMS50412.2020.9236989","DOIUrl":null,"url":null,"abstract":"Effective network congestion control strategies are the key to secure the normal operation of complex and changeable networks. The fundamental assumptions of many existing TCP congestion control variants dominated by hand-crafted heuristic algorithms are no longer valid. We propose an algorithm called TCP-Proximal Policy Congestion Control (TCP-PPCC), which is based on deep reinforcement learning algorithm Proximal Policy Optimization (PPO). TCP-PPCC updates the policy offline from the features of the preceding network state and feedback from the current network environment and adjusts the congestion window online with the updated policy. The senders with TCP-PPCC can learn about the changes in network bandwidth more accurately and adjust the congestion window in time. We demonstrate the performance of TCP-PPCC by comparing it with the traditional congestion control algorithm NewReno in four network scenarios with the ns-3 simulator. The results show that in scenario 2, TCP-PPCC takes 58.75% improvement in average delay and 27.80% improvement in throughput compared with NewReno.","PeriodicalId":122940,"journal":{"name":"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"TCP-PPCC: Online-Learning Proximal Policy for Congestion Control\",\"authors\":\"Jing Li, Yuyao Guan, Pengpeng Ding, Shiwei Wang\",\"doi\":\"10.23919/APNOMS50412.2020.9236989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Effective network congestion control strategies are the key to secure the normal operation of complex and changeable networks. The fundamental assumptions of many existing TCP congestion control variants dominated by hand-crafted heuristic algorithms are no longer valid. We propose an algorithm called TCP-Proximal Policy Congestion Control (TCP-PPCC), which is based on deep reinforcement learning algorithm Proximal Policy Optimization (PPO). TCP-PPCC updates the policy offline from the features of the preceding network state and feedback from the current network environment and adjusts the congestion window online with the updated policy. The senders with TCP-PPCC can learn about the changes in network bandwidth more accurately and adjust the congestion window in time. We demonstrate the performance of TCP-PPCC by comparing it with the traditional congestion control algorithm NewReno in four network scenarios with the ns-3 simulator. The results show that in scenario 2, TCP-PPCC takes 58.75% improvement in average delay and 27.80% improvement in throughput compared with NewReno.\",\"PeriodicalId\":122940,\"journal\":{\"name\":\"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/APNOMS50412.2020.9236989\",\"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 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APNOMS50412.2020.9236989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

有效的网络拥塞控制策略是保证复杂多变网络正常运行的关键。许多由手工设计的启发式算法主导的现有TCP拥塞控制变体的基本假设不再有效。我们提出了一种基于深度强化学习算法近端策略优化(PPO)的tcp -近端策略拥塞控制(TCP-PPCC)算法。TCP-PPCC根据上述网络状态的特征和当前网络环境的反馈离线更新策略,并根据更新后的策略在线调整拥塞窗口。使用TCP-PPCC协议的发送方可以更准确地了解网络带宽的变化,及时调整拥塞窗口。通过在ns-3模拟器上对TCP-PPCC与传统拥塞控制算法NewReno在四种网络场景下的性能进行了比较。结果表明,在场景2中,TCP-PPCC比NewReno平均时延提高58.75%,吞吐量提高27.80%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
TCP-PPCC: Online-Learning Proximal Policy for Congestion Control
Effective network congestion control strategies are the key to secure the normal operation of complex and changeable networks. The fundamental assumptions of many existing TCP congestion control variants dominated by hand-crafted heuristic algorithms are no longer valid. We propose an algorithm called TCP-Proximal Policy Congestion Control (TCP-PPCC), which is based on deep reinforcement learning algorithm Proximal Policy Optimization (PPO). TCP-PPCC updates the policy offline from the features of the preceding network state and feedback from the current network environment and adjusts the congestion window online with the updated policy. The senders with TCP-PPCC can learn about the changes in network bandwidth more accurately and adjust the congestion window in time. We demonstrate the performance of TCP-PPCC by comparing it with the traditional congestion control algorithm NewReno in four network scenarios with the ns-3 simulator. The results show that in scenario 2, TCP-PPCC takes 58.75% improvement in average delay and 27.80% improvement in throughput compared with NewReno.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信