2,322 views
2 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 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
Position:
Show:

Related questions

0 0 votes
0 0 answers
632
632 views
richa116 asked Dec 21, 2015
632 views
Ans is 5 RTT ,but I think it should be 4 RTTs. Please correct me.
3 3 votes
1 1 answer
350
350 views
ASH1198 asked Feb 4
350 views
In a shared 75 kbps channel, each station transmits a 20-bit frame every 2000 ms. If the networkuses Slotted Aloha, what is the maximum number of stations that can be sup...
0 0 votes
1 1 answer
460
460 views
Priyanka 2 asked Oct 29, 2024
460 views
1. Consider the data transfer using TCP over a 1 Gbps link. Assuming that the maximum segment lifetime (MSL) is set to 60 seconds, the minimum number of bits required for...