Let the simpli ed TCPs 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 reduce, congestion window size decreases by half (if result is not integer, round down to nearest integer). Assume that two TCP connections, C1and C2, share single congested link of speed 30 segments per second. Suppose that both C1 and C2 are in congestion avoidance phase. Connection C1s RTT is 100 ms and connection C2s RTT is 200 ms. Suppose that when data rate in link exceeds links speed, all TCP connections experience data segment loss.
a. If both C1 and C2 at time t0 have congestion window of 10 segments, determine their congestion window sizes after 2200 msec?
b. In long run, will these two connections get same share of the bandwidth of congested link? Describe.