• retagged by
39,222 views
64 64 votes

Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size:

  1. The cwnd increases by $2$ MSS on every successful acknowledgment
  2. The cwnd approximately doubles on every successful acknowledgment
  3. The cwnd increases by $1$ MSS every round trip time
  4. The cwnd approximately doubles every round trip time

Which one of the following is correct?

  1. Only $\text{(ii)}$ and $\text{(iii)}$ are true
  2. Only $\text{(i)}$ and $\text{(iii)}$ are true
  3. Only $\text{(iv)}$ is true
  4. Only $\text{(i)}$ and $\text{(iv)}$ are true

11 Answers

Best answer
74 74 votes

Each time an $ACK$ is received by the sender, the congestion window is increased by $1$ segment: $CWND = CWND + 1$.

$CWND$ increases exponentially on every $RTT$.

Hence, correct answer is C.

https://www.utdallas.edu/~venky/acn/CongestionControl.pdf

• edited by
35 35 votes

Round trip time(RTT) is the length of time it takes for a signal to be sent plus the length of time it takes for an acknowledgement of that signal to be received.

Whenever a successful acknowledgement is received cwnd increases by 1. Now coming to RTT we are supposed to receive all acknowledgements within RTT. let number of segments sent is n, then in turn we will receive n ack. so now new cwnd size will be equal to last_cwnd_size(n) + number_of_ack_received(n) i.e. cwnd=n+n. which can also be said as cwnd doubles on every RTT.

now we can say that only (iv) option is the correct one

6 6 votes

In slow start phase, reception of each ACK adds 1 MSS to cwnd.

 

Generally, if you send, say 4 packets (cwnd = 4) then in the time approximately equal to an RTT you'll get 4 ACKs in return. These 4 ACKs would add a total of 4 MSS in the cwnd.

 

Hence approximately we double our cwnd every RTT in Slow Start Phase. Statement iv is True.


Statement i is wrong as cwnd increases by 1 MSS on every ACK received. Hence, Statement ii is also wrong.


Statement iii could be true with slight modifications.

If every RTT successfully delivers you an ACK, then in the time somewhat equal to RTT, cwnd will get doubled. "Somewhat equal" because we'll have to wait for ACKs to get delivered back-to-back.

6 6 votes

 

  • INITIALLY CWND = 1 
  • CWND DOUBLES ON EVERY RTT
  • CWND INCREMENTS BY ONE ON EVERY ACKNOLDEGEMENT

(i) False, because the cnwd increases by 1MSS(cnwd=cnwd+1) on every successful acknowledgement (when sender receive an acknowledgement).

(ii) False, because same reason as above.

(iii) False, because the cnwd increases exponentially on every RTT.

(iv) True, because the cnwd increases exponentially on every RTT so we can say that it approximately double the cnwd.

i hope the above picture clears everything.
 

• edited by
3 3 votes
TCP uses sliding window protocol and that too sr protocol as it can receive out of window packets and with each ack received it it shift the window. In case of slow start with each ack congestion window is increased by 1 and effectively after each rtt congestion window has increased by 2 times. If an ack acknowledges 2 segment than also cwnd is still increased by 1 segment, enven if ack acknowlsedges a segment that is less than mss still cwnd is increased by 1.

In congestion avoidance phase increase cwnd as cwnd=cwnd+1/(floor(cwnd)). So cwnd segment is increased  if all the cwnd segment has been acknowledged.
2 2 votes

in slow start algorithm sender first send one packet if it receives ack with in timeout the it send two packets in 2nd rtt tf it receives ack within timeout then it increase cwnd as exponentially.if it will not receive with in timeout the sender will decrease the size of cwnd to half.so in slow start 

The cwnd approximately doubles every round trip time .

so option c correct

Answer:
Position:
Show:

Related questions

67 67 votes
9 answers 9 answers
40.1k
40.1k views
gatecse asked Feb 14, 2018
40,135 views
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $12...
117 117 votes
13 answers 13 answers
56.7k
56.7k views
go_editor asked Sep 26, 2014
56,720 views
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...
1 1 vote
1 1 answer
1.3k
1.3k views
Arjun asked Jan 2, 2019
1,266 views
Consider the following two statements:S1 : TCP handles both congestion and flow controlS2 : UDP handles congestion but not flow controlWhich of the following options is c...