Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each flow is assured a minimum traffic rate. Simulations are used to demonstrate the accuracy of this technique for relatively low values of packet dropping probability and a much wider range of packet marking probability.
MISRA, Archan; Ott, T.; and Baras, J..
Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows. (2002). Computer Networks. 40, (4), 557-576. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/663