Generalized TCP Congestion Avoidance and Its Effect on Bandwidth Sharing and Variability
Date: November 27 - December 01, 2000
To model possible suggested changes in TCP window adaptation in response to randomized feedback, such as ECN, we formulate a generalized verslon of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck buffer under the Assured Service model and use a fixed point technique to obtain the mean window sizes and throughputs for the TCP flows. To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-cum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under state-dependent randomized congestion feedback.