【24h】

A new fair window algorithm for ECN capable TCP (new-ECN)

机译:具有ECN功能的TCP(new-ECN)的新的公平窗口算法

获取原文

摘要

In this paper we propose a modification of the explicit congestion notification (ECN) to correct the bias against connections with long round trip times (RTT) of TCP. The new-ECN algorithm achieves a fair sharing of the available bandwidth of a bottleneck gateway. The idea is to prevent a fast connection from opening its congestion window too quickly and to enable a slow connection to open its window more aggressively. This is done by modifying not only the congestion window size but also by modifying its rate of increase. Both are reduced while receiving marked packets and are increased during times of no congestion. We demonstrate the effect and performance of the new-ECN algorithm with the network simulator "ns" for different network topologies. Additionally, we study the TCP and ECN-TCP friendliness of the new-ECN algorithm. In this paper we only focus on the single bottleneck case. The behavior of new-ECN with multiple congested gateways needs further research.
机译:在本文中,我们提出了修改了显式拥塞通知(ECN),以纠正与TCP的长往返时间(RTT)的连接偏差。新的ECN算法实现了瓶颈网关的可用带宽的公平共享。该想法是防止快速连接快速打开其拥塞窗口,并使缓慢连接能够更加积极地打开其窗口。这是通过修改拥塞窗口大小的修改,而且通过修改其增加率来完成。在接收标记的数据包的同时减少,并且在没有拥塞期间增加。我们展示了新型ECN算法对不同网络拓扑的网络模拟器“NS”的效果和性能。此外,我们研究了新型ECN算法的TCP和ECN-TCP友好性。在本文中,我们只关注单个瓶颈案例。具有多种拥挤网关的新ECN的行为需要进一步研究。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号