有损网络上多方并行下载的改进立方拥塞避免

Yu-Yen Chung
{"title":"有损网络上多方并行下载的改进立方拥塞避免","authors":"Yu-Yen Chung","doi":"10.1145/3587819.3597029","DOIUrl":null,"url":null,"abstract":"With the rapid growth of online video viewing, the quality of experience for users become a critical factor in the video streaming service to attract users and increase their adherence. Multi-side parallel downloading, which requests video segments from various low-cost data nodes simultaneously, could be a strategy to reduce the latency and improve the experience. However, the communication between such data nodes might not be as reliable as a conventional dedicated server. In such a network, the random loss events may bias the loss-based congestion control. Accordingly, this work incorporates a reevaluation mechanism into the CUBIC congestion avoidance state to correct the underestimation of the congestion window. In the experiment, we analyzed the round-trip time pattern and the transmission speed of CUBIC against our modification via network simulation with various loss rates. Our result shows that reevaluation helps to recover the congestion window and to improve the transmission speed in the extremely high-loss network. The derived insight may benefit the future improvement of loss-based congestion control. This paper presents one of the winning team's strategies in the MMSys23 Grand Challenge. The submitted code can be found on GitHub.1.","PeriodicalId":330983,"journal":{"name":"Proceedings of the 14th Conference on ACM Multimedia Systems","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modified CUBIC Congestion Avoidance for Multi-side Parallel Downloading over Lossy Networks\",\"authors\":\"Yu-Yen Chung\",\"doi\":\"10.1145/3587819.3597029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid growth of online video viewing, the quality of experience for users become a critical factor in the video streaming service to attract users and increase their adherence. Multi-side parallel downloading, which requests video segments from various low-cost data nodes simultaneously, could be a strategy to reduce the latency and improve the experience. However, the communication between such data nodes might not be as reliable as a conventional dedicated server. In such a network, the random loss events may bias the loss-based congestion control. Accordingly, this work incorporates a reevaluation mechanism into the CUBIC congestion avoidance state to correct the underestimation of the congestion window. In the experiment, we analyzed the round-trip time pattern and the transmission speed of CUBIC against our modification via network simulation with various loss rates. Our result shows that reevaluation helps to recover the congestion window and to improve the transmission speed in the extremely high-loss network. The derived insight may benefit the future improvement of loss-based congestion control. This paper presents one of the winning team's strategies in the MMSys23 Grand Challenge. The submitted code can be found on GitHub.1.\",\"PeriodicalId\":330983,\"journal\":{\"name\":\"Proceedings of the 14th Conference on ACM Multimedia Systems\",\"volume\":\"142 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 14th Conference on ACM Multimedia Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3587819.3597029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 14th Conference on ACM Multimedia Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3587819.3597029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着在线视频观看量的快速增长,用户体验的质量成为视频流服务吸引用户和增加用户粘性的关键因素。同时从多个低成本数据节点请求视频片段的多方并行下载可能是一种减少延迟和改善体验的策略。但是,这些数据节点之间的通信可能不像传统的专用服务器那样可靠。在这种网络中,随机丢失事件可能会影响基于丢失的拥塞控制。因此,本研究在CUBIC拥塞避免状态中引入了一种重新评估机制,以纠正对拥塞窗口的低估。在实验中,我们通过网络仿真分析了在不同损失率下修改后CUBIC的往返时间模式和传输速度。结果表明,重评估有助于恢复拥塞窗口,提高极高损耗网络中的传输速度。所得的见解可能有助于未来改进基于损失的拥塞控制。本文介绍了MMSys23大挑战赛中获胜团队的策略之一。提交的代码可以在GitHub.1上找到。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modified CUBIC Congestion Avoidance for Multi-side Parallel Downloading over Lossy Networks
With the rapid growth of online video viewing, the quality of experience for users become a critical factor in the video streaming service to attract users and increase their adherence. Multi-side parallel downloading, which requests video segments from various low-cost data nodes simultaneously, could be a strategy to reduce the latency and improve the experience. However, the communication between such data nodes might not be as reliable as a conventional dedicated server. In such a network, the random loss events may bias the loss-based congestion control. Accordingly, this work incorporates a reevaluation mechanism into the CUBIC congestion avoidance state to correct the underestimation of the congestion window. In the experiment, we analyzed the round-trip time pattern and the transmission speed of CUBIC against our modification via network simulation with various loss rates. Our result shows that reevaluation helps to recover the congestion window and to improve the transmission speed in the extremely high-loss network. The derived insight may benefit the future improvement of loss-based congestion control. This paper presents one of the winning team's strategies in the MMSys23 Grand Challenge. The submitted code can be found on GitHub.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学术官方微信