Question
Consider a simplified TCP's AIMD algorithm where congestion window size is measured in number of segments, not in bytes. In additive increase, congestion window size increases by one segment in each RTT. In multiplicative decrease, congestion window size decreases by half (if the result is not an integer, round down to the nearest integer). Assume that 2 TCP connections, C1 and C2, share a single congested link of speed 30 segments per second. Suppose that both C1 and C2 are in the congestion avoidance phase. Connection C1's RTT is 50 msec and connection C2's RTT is 100 msec. suppose that when the data rate in link exceeds the link's speed, all TCP connections experience data segment loss.