Performance of TCP over lossy upstream and downstream links with link-level retransmissions

F. Anjum, R. Jain
{"title":"Performance of TCP over lossy upstream and downstream links with link-level retransmissions","authors":"F. Anjum, R. Jain","doi":"10.1109/ICON.2000.875760","DOIUrl":null,"url":null,"abstract":"We study the efficacy of using link-layer retransmissions to improve the TCP performance over lossy wireless links. The scenario we consider is where TCP packets traverse a wired network to a base station, and thence over a single wireless hop to a stationary receiver. Unlike many previous studies, which rely on simulation, we develop an analytical model for calculating TCP throughput; unlike all previous analytical studies, we do not ignore the possibility of acknowledgement packets (ACKs) being lost on the reverse link from the wireless receiver to the base station. The analytical model captures the performance of four common TCP algorithms: OldTahoe, Tahoe, NewReno and Sack. We find that, for the scenarios studied, a moderate number of link-level retransmissions can significantly improve the throughput of TCP and its resilience to packet losses on the forward and reverse links; increasing the number of retransmissions further has relatively little benefit. We also show that ACK losses cannot be ignored unless the number of retransmissions permitted is high or errors on the reverse link are infrequent. Of the TCP algorithms studied, we find that Sack has the best performance, closely followed by NewReno; the performance of OldTahoe is very poor. We end with suggestions for further work.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

We study the efficacy of using link-layer retransmissions to improve the TCP performance over lossy wireless links. The scenario we consider is where TCP packets traverse a wired network to a base station, and thence over a single wireless hop to a stationary receiver. Unlike many previous studies, which rely on simulation, we develop an analytical model for calculating TCP throughput; unlike all previous analytical studies, we do not ignore the possibility of acknowledgement packets (ACKs) being lost on the reverse link from the wireless receiver to the base station. The analytical model captures the performance of four common TCP algorithms: OldTahoe, Tahoe, NewReno and Sack. We find that, for the scenarios studied, a moderate number of link-level retransmissions can significantly improve the throughput of TCP and its resilience to packet losses on the forward and reverse links; increasing the number of retransmissions further has relatively little benefit. We also show that ACK losses cannot be ignored unless the number of retransmissions permitted is high or errors on the reverse link are infrequent. Of the TCP algorithms studied, we find that Sack has the best performance, closely followed by NewReno; the performance of OldTahoe is very poor. We end with suggestions for further work.
TCP在带有链路级重传的有损上行和下行链路上的性能
我们研究了在有损耗的无线链路上使用链路层重传来提高TCP性能的有效性。我们考虑的场景是TCP数据包通过有线网络到达基站,然后通过单个无线跳到达固定接收器。与许多以前的研究不同,这些研究依赖于模拟,我们开发了一个分析模型来计算TCP吞吐量;与以往的分析研究不同,我们没有忽略从无线接收器到基站的反向链路上丢失确认数据包(ack)的可能性。分析模型捕获了四种常见TCP算法的性能:OldTahoe, Tahoe, NewReno和Sack。我们发现,在所研究的场景中,适度的链路级重传可以显著提高TCP的吞吐量及其在正向和反向链路上对数据包丢失的弹性;进一步增加重传次数的好处相对较少。我们还表明,除非允许的重传次数很高或反向链路上的错误很少,否则不能忽略ACK损耗。在所研究的TCP算法中,Sack算法的性能最好,其次是NewReno算法;OldTahoe的性能非常差。最后,我们提出了进一步工作的建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信