Computer Science, asked by yasjjoshi3203, 1 year ago

Consider an instance of tcps additive increase multiplicative decrease (aimd) algorithm where the window size at the start of slow start phase is 2 kb and the threshold at the start of first transmission is 24 kb. Assume that 3 duplicate ack are received during the 5th transmission what is the congestion window size at the end of 10th transmission?

Answers

Answered by panshulo1
0

Write the question properly

Similar questions