General AIMD Congestion Control

Instead of the increase-by-onedecrease-to-halfstrategy used in TCP Reno for congestion window adjustment, we consider the general case such that the increase value and decrease ratio are parameters. That is, in the congestion avoidance state, the window size is increased by per window of packets acknowledged and it is decreased to of the current value when there is congestion indication. We refer to this window adjustment strategy as general additive increase multiplicative decrease (GAIMD). We present the (mean) sending rate of a GAIMD flow as a function of , , loss rate, mean roundtrip time, mean timeout value, and the number of packets acknowledged by each ACK. We conducted extensive experiments to validate this sending rate formula. We found the formula to be quite accurate for a loss rate of up to 20%. We also present in this paper a simple relationship between and for a GAIMD flow to be TCP-friendly, that is, for the GAIMD flow to have approximately the same sending rate as a...

• Type: Conference
• Year: 2000
• Where: ICNP
• Authors: Yang Richard Yang, Simon S. Lam
• Keywords: Computer Networks, Gaimd flows, ICNP 2000, Sending Rate, TCP Reno