arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.8173cs.NI
收藏

考虑随机丢包的TCP排队模型

Modeling TCP Throughput with Random Packet Drops

Daniel Zaragoza

摘要:

本报告涉及长期吞吐量的建模,传输控制协议(TCP)的发送速率。(i)我们考虑一个单一的“无限源”使用从发送者到接收者的网络路径。(ii)每个TCP分组以概率Pi随机丢弃,与先前的丢弃或任何其他事件/参数无关。(iii)永不改变的接收方窗口限制了未完成数据的数量。(iv)接收方确认每个数据包。(v)这里所建模的TCP在拥塞控制方面符合公共可用标准(RFC)。我们验证和确定的限制,这里提出的不同的模型,使用数据包级模拟。目前的工作的贡献如下:(a)我们确定三个制度,和他们的适用条件,根据p:线性法律制度,平方根法律制度,超时制度。(b)至于线性和平方根制度之间的关系,我们提供了额外的见解相对于以前发表的工作。(c)我们给出了在任何制度下的TCP发送速率的精确方程。(d)在路径不饱和的条件下,从精确方程出发,给出并讨论了TCP的NewReno变体的发送速率的近似表达式。这些计算的副产品是发送方窗口的分布,与任何定时或饱和考虑无关。(e)与模拟结果相比,这些近似值给出的结果精确到百分之几。详细的比较和理论和模拟之间的误差来源进行了讨论。

英文摘要:

The present report deals with the modeling of the long-term throughput, a.k.a., send rate, of the Transmission Control Protocol (TCP) under the following assumptions. (i) We consider a single 'infinite source' using a network path from sender to receiver. (ii) Each TCP packet is randomly dropped with probability p; independently of previous drops or any other event/parameter. (iii) The - never changing - receiver window limits the amount of outstanding data. (iv) The receiver acknowledges every packet. (v) The TCP modeled here conforms to the publicly available standards (RFCs) as concerns congestion control. We validate and determine the limits of the different models proposed here using packet-level simulations. The contributions of the present work are the following: (a) We determine three regimes, and their conditions of applicability, depending on p: Linear law regime, square root law regime, and timeout regime. (b) As concerns the relationship between the linear and square root regimes, we give additional insights relatively to previously published work. (c) We give the exact equations governing the TCP send rate in any regime. (d) From the exact equation and under the further condition that the path is not saturated, we give and discuss approximations for the send rate of the NewReno variant of TCP. A by-product of these calculations is the distribution of the sender window, independently of any timing or saturation consideration. (e) These approximations give results that are accurate to a few percent when compared to simulation results. Detailed comparison and sources of errors between theory and simulations are also discussed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑