1,868 views
1 1 vote

1 Answer

1 1 vote
We wait 300 ms initially to detect the third duplicate ACK, and then one full 800 ms RTT as the sender waits for the ACK of the retransmitted segment.

Suppose pakcet number P is sent at t=0 by the sender's clock. Suppose P is lost. 7 packets – P+1 to P+7 - will be sent at t=100, 200, ..., 700, since the window size is 8. Sender stops sending at t=800, since window size is 8 and ACK for P has not arrived. ACK for P+1, P+2 and P+3 will be duplicate ACKs of P-1, and will arrive at t=900, 1000 and 1100.

P is re-transmitted at t=1100. ACK arrives at 1900.

Hence time lost = 1900-800 = 1100.( in msec)
Answer:
Position:
Show:

Related questions

2 2 votes
2 2 answers
2.7k
2.7k views
Sandy Sharma asked Jan 6, 2019
2,693 views
Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mec...
3 3 votes
4 answers 4 answers
2.7k
2.7k views
shikharV asked Jan 18, 2016
2,713 views
Given solution:I couldn't understand from reaching 1KB to 16KB why it took 50ms not 40ms. Please check
3 3 votes
1 answers 1 answer
482
482 views
js__ asked Jan 20
482 views
i am getting as 45  
0 0 votes
1 1 answer
559
559 views
Shreyas_Jadhav asked Jan 31, 2025
559 views
Source: Forouzan Page 771Congestion Avoidance Algorithm:In this algorithm, each time the whole window of segments is acknowledged (one round), the size of the congestion ...