1,091 views
2 votes
2 votes
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB. The receiver advertise its window at the starting of communication to be 24 KB. Assume the size of advertise window is never changed by the receiver throughout the
communication. The time taken to send the full window is _________ msec, considering RTT of 10 msec.

I think it should be 9rtts but the solution says 10rtts since after 9 RTTs we would be able to send full 24kb window  

Can somebody provide some refrence links for this

1 Answer

0 votes
0 votes

I assume that communication is being set up. SO, their is no value of ssthreshold set up. So, we need to increase exponentially(or linearly in avoidance phase) till we get timeout.

We start with 1 MSS

1 MSS

2 MSS

4 MSS

8 MSS - 16KB

16MSS - 32KB

Now, this will create timeout So, ssthreshold = 24/2 = 12KB = 6MSS

Note: Here, they have given receiver window and it has nothing to do with congestion window. Just assumed that 24KB is also congestion window.

1MSS

2MSS

4MSS

5MSS

6MSS

7MSS

8MSS

9MSS

10MSS

11MSS

12MSS

So, 15 RTTs

edited by

Related questions

0 votes
0 votes
0 answers
1
richa116 asked Dec 21, 2015
320 views
Ans is 5 RTT ,but I think it should be 4 RTTs. Please correct me.
0 votes
0 votes
0 answers
2
54Y4N asked Oct 9, 2023
233 views
A 1 kilometer long CSMA/CD (not 802.3) has a propagation speed of 200m/ìsec. Repeaters are not allowed in this system Data frames are 256 bits long, including 32 bits of...