TCP存在突发损失

E. Altman, Konstantin Avrachenkov, C. Barakat
{"title":"TCP存在突发损失","authors":"E. Altman, Konstantin Avrachenkov, C. Barakat","doi":"10.1145/339331.350541","DOIUrl":null,"url":null,"abstract":"We analyze in this paper the performance of TCP/IP-like congestion control in the presence of random losses. The input rate in the control scheme that we consider has a linear growth rate; whenever a loss occurs, the input rate is halved. This approximates the performance of several versions of TCP/IP that divide their congestion window by two whatever is the cause of the loss. We propose a mathematical model that allows to account for burstiness as well as for correlation in the loss process. Our aim is to study the impact of burstiness on the throughput of the connection. We compute the expected instantaneous input rate and its moments at some potential loss instants, and provide for a useful implicit expression for the Laplace Stieltjis Transform. This allows us to compute explicitly the average throughput and its moments. We show that the average throughput is indeed sensitive to the distribution of the loss process, and not just to the average loss rate: for a given average loss rate, we show that the throughput increases with the burstiness of the loss process. We finally examine the impact of burstiness of losses on the throughput variability.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2000-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"104","resultStr":"{\"title\":\"TCP in presence of bursty losses\",\"authors\":\"E. Altman, Konstantin Avrachenkov, C. Barakat\",\"doi\":\"10.1145/339331.350541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze in this paper the performance of TCP/IP-like congestion control in the presence of random losses. The input rate in the control scheme that we consider has a linear growth rate; whenever a loss occurs, the input rate is halved. This approximates the performance of several versions of TCP/IP that divide their congestion window by two whatever is the cause of the loss. We propose a mathematical model that allows to account for burstiness as well as for correlation in the loss process. Our aim is to study the impact of burstiness on the throughput of the connection. We compute the expected instantaneous input rate and its moments at some potential loss instants, and provide for a useful implicit expression for the Laplace Stieltjis Transform. This allows us to compute explicitly the average throughput and its moments. We show that the average throughput is indeed sensitive to the distribution of the loss process, and not just to the average loss rate: for a given average loss rate, we show that the throughput increases with the burstiness of the loss process. We finally examine the impact of burstiness of losses on the throughput variability.\",\"PeriodicalId\":19766,\"journal\":{\"name\":\"Perform. Evaluation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"104\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Perform. Evaluation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/339331.350541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Perform. Evaluation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/339331.350541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 104

摘要

本文分析了随机丢失情况下类TCP/ ip拥塞控制的性能。我们所考虑的控制方案中的输入速率具有线性增长率;每当发生损耗时,输入速率减半。这近似于几个版本的TCP/IP的性能,这些版本将它们的拥塞窗口分成两个,无论损失的原因是什么。我们提出了一个数学模型,允许在损失过程中考虑突发性和相关性。我们的目的是研究突发对连接吞吐量的影响。我们计算了期望的瞬时输入率及其在某些潜在损失时刻的矩,并给出了一个有用的拉普拉斯Stieltjis变换的隐式表达式。这允许我们显式地计算平均吞吐量及其力矩。我们证明了平均吞吐量确实对损耗过程的分布敏感,而不仅仅是对平均损失率敏感:对于给定的平均损失率,我们证明了吞吐量随着损耗过程的突发性而增加。最后,我们研究了突发损失对吞吐量可变性的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
TCP in presence of bursty losses
We analyze in this paper the performance of TCP/IP-like congestion control in the presence of random losses. The input rate in the control scheme that we consider has a linear growth rate; whenever a loss occurs, the input rate is halved. This approximates the performance of several versions of TCP/IP that divide their congestion window by two whatever is the cause of the loss. We propose a mathematical model that allows to account for burstiness as well as for correlation in the loss process. Our aim is to study the impact of burstiness on the throughput of the connection. We compute the expected instantaneous input rate and its moments at some potential loss instants, and provide for a useful implicit expression for the Laplace Stieltjis Transform. This allows us to compute explicitly the average throughput and its moments. We show that the average throughput is indeed sensitive to the distribution of the loss process, and not just to the average loss rate: for a given average loss rate, we show that the throughput increases with the burstiness of the loss process. We finally examine the impact of burstiness of losses on the throughput variability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信