General AIMD congestion control

Instead of the increase-by-one decrease-to-half strategy used in TCP for congestion window adjustment, we con-sider 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 win-dow 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 round-trip time, mean timeout value, and the number of packets acknowledged by each ACK. We con-ducted 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 ap-proximately the same sending rate as a TCP flow under the same path conditions. We present results from simulations in which TCP-friendly GAIMD flows ( = 0:31, = 7=8) compete for bandwidth with TCP Reno flows and with TCP SACK flows, on a DropTail link as well as on a RED link. We found that the GAIMD flows were highly TCP-friendly. Fur-thermore, with at 7/8 instead of 1/2, these GAIMD flows have reduced rate fluctuations compared to TCP flows. 1