edited by
2,913 views
2 votes
2 votes

Q).Suppose that TCP congestion window is set to $28 \text{KB}$ and time-out occurs.The window size after the next six successful transmission bursts (Assume maximum segment size is $2 \text{KB}$ and TCP uses congestion avoidance) is _______(in KB)

edited by

4 Answers

Best answer
3 votes
3 votes
20 kb
selected by
4 votes
4 votes
2,4,8,14,16,18  so Ans=18
1 votes
1 votes

When a timeout occurs, three things happend. First, slow start will be initiated. Second, the congestion window would start at 1. Third, the threshold will be reset to 28KB/2=14KB. If the next four transmission are all successful, then

  • 1st transmission: 1 segment, 2KB
  • 2nd transmission: 2 segments, 4KB
  • 3rd transmission: 4 segments, 8KB
  • 4th transmission: 8 segments, 16KB
  • 5th transmission: 16 segments, 32KB
  • 6th transmission: 32 segments, 64KB

After these six successful transmissions, the window size is supposed to be 64. However, since the threshold is 14KB, the window size can only be 14 KB.

–1 votes
–1 votes
Anwer shold be 14KB
Answer:

Related questions

1.9k
views
0 answers
5 votes
MiNiPanda asked Jan 15, 2019
1,935 views
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ trans...
973
views
1 answers
2 votes
Markzuck asked Jan 10, 2019
973 views
here TOTAL 2000 segments need to be sent, and after x RTT, it will send 2001 segments but for total we shall take count of addition of all the previous also na?
824
views
0 answers
1 votes
Markzuck asked Dec 26, 2018
824 views
I am getting answer as 9, someone please post their solution stepwise, that would be of great help to identify the mistake.
870
views
1 answers
0 votes
abhishek1995_cse asked Sep 29, 2018
870 views
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD)algorithm where the window size at the start of slow start phase is 1 MSS and thethreshold...