Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD)…

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 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.

Treat each transmission as one round. After each successful round, replace cwnd by min(2·cwnd, ssthresh) if cwnd < ssthresh; otherwise increase cwnd by 1 MSS. The timeout ends round 5, sets ssthresh to half the cwnd used in that round, and resets cwnd to 1 MSS. Rounds 6–10 succeed.