改进多路径网络中TCP重排序的鲁棒性

Changming Ma, Ka-Cheong Leung
{"title":"改进多路径网络中TCP重排序的鲁棒性","authors":"Changming Ma, Ka-Cheong Leung","doi":"10.1109/LCN.2004.66","DOIUrl":null,"url":null,"abstract":"The TCP performance can deteriorate substantially in multipath packet-forwarding networks which induce persistent packet reordering. Focusing on these networks, we propose a simple algorithm to adaptively adjust the value of dupthresh, the threshold of duplicate acknowledgement at which the TCP fast retransmission algorithm is triggered, to improve the TCP performance. It uses an exponentially weighted moving average (EWMA) and the mean deviation of the length of reordering events to adjust the value of dupthresh. Our algorithm also computes an upper bound of dupthresh to avoid retransmission timeout events. In addition, it provides a mechanism to decrease dupthresh at the retransmission timeout (RTO) events. The simulation results show that our algorithm improves the protocol performance significantly with very low overhead. It achieves a greater throughput and fewer false fast retransmissions.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Improving TCP reordering robustness in multipath networks\",\"authors\":\"Changming Ma, Ka-Cheong Leung\",\"doi\":\"10.1109/LCN.2004.66\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The TCP performance can deteriorate substantially in multipath packet-forwarding networks which induce persistent packet reordering. Focusing on these networks, we propose a simple algorithm to adaptively adjust the value of dupthresh, the threshold of duplicate acknowledgement at which the TCP fast retransmission algorithm is triggered, to improve the TCP performance. It uses an exponentially weighted moving average (EWMA) and the mean deviation of the length of reordering events to adjust the value of dupthresh. Our algorithm also computes an upper bound of dupthresh to avoid retransmission timeout events. In addition, it provides a mechanism to decrease dupthresh at the retransmission timeout (RTO) events. The simulation results show that our algorithm improves the protocol performance significantly with very low overhead. It achieves a greater throughput and fewer false fast retransmissions.\",\"PeriodicalId\":366183,\"journal\":{\"name\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2004.66\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th Annual IEEE International Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2004.66","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在多路径数据包转发网络中,TCP的性能会大幅下降,从而导致数据包的持续重排序。针对这些网络,我们提出了一种简单的算法来自适应调整dupthresh的值,dupthresh是触发TCP快速重传算法的重复确认阈值,以提高TCP性能。它使用指数加权移动平均(EWMA)和重排序事件长度的平均偏差来调整dupthresh的值。我们的算法还计算了重传的上限,以避免重传超时事件。此外,它还提供了一种机制来减少重传超时(RTO)事件时的重传刷新。仿真结果表明,该算法在很小的开销下显著提高了协议性能。它实现了更大的吞吐量和更少的虚假快速重传。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving TCP reordering robustness in multipath networks
The TCP performance can deteriorate substantially in multipath packet-forwarding networks which induce persistent packet reordering. Focusing on these networks, we propose a simple algorithm to adaptively adjust the value of dupthresh, the threshold of duplicate acknowledgement at which the TCP fast retransmission algorithm is triggered, to improve the TCP performance. It uses an exponentially weighted moving average (EWMA) and the mean deviation of the length of reordering events to adjust the value of dupthresh. Our algorithm also computes an upper bound of dupthresh to avoid retransmission timeout events. In addition, it provides a mechanism to decrease dupthresh at the retransmission timeout (RTO) events. The simulation results show that our algorithm improves the protocol performance significantly with very low overhead. It achieves a greater throughput and fewer false fast retransmissions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信