A New Fair Window Algorithm for ECN-Capable TCP (New-ECN)

Abstract—In this paper we propose a modification of the Explicit Congestion Notification (ECN) [1] 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” [4] 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 rese...

• Type: Conference
• Year: 2000
• Where: INFOCOM
• Authors: Tilo Hamann, Jean C. Walrand
• Keywords: Communications, Congestion Window, Congestion Window Size, Explicit Congestion Notification, INFOCOM 2000