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

TCP无延迟拥塞控制的分析模型

Analytical Model of TCP Relentless Congestion Control

Rémi Diana, Emmanuel Lochin

摘要:

本文介绍了MattMathis提出的一种Relentless拥塞控制模型。Relentless拥塞控制(RCC)是AIMD(Additive Increase Multiplicative Decrease)拥塞控制的一种改进,它通过减少TCP拥塞窗口的丢失段数而不是将其减半。尽管ICCRG IRTF组正在进行一些讨论,但据我们所知,这种拥塞控制从未被建模。在本文中,我们提供了一个分析模型,这种新的拥塞控制,并提出了一种实现RCC的常用网络模拟器ns-2。我们还改进了RCC,增加了一个丢失重传检测方案(基于SACK+),以防止由丢失重传引起的RTO,并将此新版本称为RCC+。所提出的模型既描述了原来的RCC算法和RCC+的改进,并允许更好地评估这种新的拥塞控制计划对网络流量的影响。

英文摘要:

We introduce a model of the Relentless Congestion Control proposed by Matt Mathis. Relentless Congestion Control (RCC) is a modification of the AIMD (Additive Increase Multiplicative Decrease) congestion control which consists in decreasing the TCP congestion window by the number of lost segments instead of halving it. Despite some on-going discussions at the ICCRG IRTF-group, this congestion control has, to the best of our knowledge, never been modeled. In this paper, we provide an analytical model of this novel congestion control and propose an implementation of RCC for the commonly-used network simulator ns-2. We also improve RCC with the addition of a loss retransmission detection scheme (based on SACK+) to prevent RTO caused by a loss of a retransmission and called this new version RCC+. The proposed models describe both the original RCC algorithm and RCC+ improvement and would allow to better assess the impact of this new congestion control scheme over the network traffic.

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

↑