Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is MSS and the threshold at the start of the first transmission is MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.
View worked solution
Answer: C
We can trace the congestion window size () and slow-start threshold () step-by-step through each transmission:
- Initial State: , .
- 1st Transmission: . Since , it is in the Slow Start phase. After successful transmission, doubles to .
- 2nd Transmission: . Since , it is in Slow Start. After successful transmission, doubles to .
- 3rd Transmission: . Since , it enters the Congestion Avoidance phase. After successful transmission, increases additively by to .
- 4th Transmission: . After successful transmission, increases to .
- 5th Transmission: . A timeout occurs during this transmission:
- New .
- is reset to the initial slow start value of .
- 6th Transmission: . Since (), it is in Slow Start. After successful transmission, doubles to .
- 7th Transmission: . Since , it is in Slow Start. Upon success, doubling would exceed (), so is capped at .
- 8th Transmission: . Since , it is in Congestion Avoidance. After successful transmission, increases to .
- 9th Transmission: . After successful transmission, increases to .
- 10th Transmission: .
Thus, the congestion window size at the start of the tenth transmission (or at the end of the ninth transmission) is .
Free practice · Your answers on this page are not saved.
