edited by
61,518 views
106 106 votes

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.

  1. $8$ MSS
  2. $14$ MSS
  3. $7$ MSS
  4. $12$ MSS

12 Answers

0 0 votes

At

t=1,⇒2MSS

t=2,⇒4MSS

t=3,⇒8MSS

t=4,⇒9MSS

(after threshold additive increase)

t=5,⇒10MSS

(fails)

Threshold will be reduced by n2

i.e. 10/2=5.

(The window size is NOT always =1MSS. Here it is mentioned  2MSS)

t=6⇒2MSS

t=7,⇒4MSS

t=8,⇒5MSS

t=9,⇒6MSS

t=9,⇒7MSS

the the congestion window size will be =7MSS.

0 0 votes

"Additive Increase, Multiplicative  Decrease Out of the  three versions of  TCP,  the  Reno  version is most  common  today.  It  has been observed that, in  this version,  most of  the  time  the congestion is  detected  and  taken care of  by  observing the three  duplicate ACKs. Even if  there are  some  time-out events, TCP recovers from them  by  aggressive  exponential  growth."

 

This is taken from Data Communications and Networking by Forouzan. 5th edition. Page 784.

 

So in my understanding:

By the end of 

1st transmission: 2+2=4

2nd transmission: 8 (slow start threshold)

3rd transmission: 9

4th transmission: 10 

During 5th a time-out occurs. In AIMD in time-out we go back to the initial MSS. Therefore:

5th transmission: 2

Then we do fast recovery in case of timeouts. 

6th transmission: 4

7th transmission: 8 (ss threshold)

8th transmission: 9

9th transmission: 10

10th transmission: 11

Which we don't have in the options. So I am assuming the recovery is not FR and Addictive increase instead. 

In that case, by the end of:

 

6th transmission: 3

7th transmission: 4

8th transmission: 5

9th transmission: 6

10th transmission: 7

 

Also according to Wikipedia, "In TCP, after slow start, the additive increase parameter a is typically one MSS (maximum segment size) per round-trip time, and the multiplicative decrease factor b is typically 1/2."

But on time out we don't do multiplicative decrease. Multiplicative decrease is in case of 3 duplicate acknowledgements. 

 

 

0 0 votes

2 I 4 I 8 I 9 I 10 I 1 I 2 I 4 I 5 I 6 I

                          ^( TIME OUT OCCURS AFTER 5TH RTT) THUS SSTHRESHOLD BECOMES= CWND/2=10/2=5

                                                     ^(10TH RTT CWND=7 MSS)

   Ans=C       If the question said after the 10th RTT then it would have been 8 MSS.                   

edited by
0 0 votes
Answer: C

$$\text{Given Threshold Th= 8 MSS}$$

$$\text{Therefore, Receiving window size } W_R= 2 \times Th \text{ = 16 MSS}$$

 

the window size at the start of the slow start phase is 2 MSS

 

$$\text{Start AIMD with 2 MSS:}$$

$$\text{2 | 4 | 8 (Th) | 9 | 10 (TO)}$$

$$\text{In case of timeout, the slow start phase starts again with new threshold = 10/2 = 5 }$$

$$\text{2 | 4 | 8 (Th) | 9 | 10 (TO) | 2 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |12 | 13 | 14 | 15 | 16 (W(R)) | 16 | 16............}$$

 

 Find the congestion window size at the end of the tenth transmission.

$$\text{The size of congestion window after the 10th transmission is the 10th term of this sequence i.e. 7 MSS}$$

 

$$\text{NOTE: Don't get confused with vertical lines, those are round trip time including the transmission AND acknowledgment.}$$

$$\text{NOTE: End of transmission means as soon as the packet leaves the sender (No acknowledgment needed)}$$

 

edited by
Answer:
Position:
Show:

Related questions

124 124 votes
13 answers 13 answers
46.0k
46.0k views
Arjun asked Sep 29, 2014
46,031 views
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...
108 108 votes
14 answers 14 answers
48.2k
48.2k views
gatecse asked Sep 26, 2014
48,156 views
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...
66 66 votes
7 answers 7 answers
17.6k
17.6k views
go_editor asked Apr 21, 2016
17,568 views
Consider the following C code segment.int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, b); ...
69 69 votes
5 answers 5 answers
23.1k
23.1k views
go_editor asked Apr 21, 2016
23,104 views
Consider the following relations $A, B$ and $C:$ $$\overset{\textbf{A}}{\begin{array}{|c|c|c|}\hline\\\textbf{Id}& \textbf{Name}& \textbf{Age} \\\hline12& \text{A...