# ACE testseries

202 views
Every acknowledgement increases the congestion window size by one.

Which phase does it refer?

a) Slow start phase

b) Fast retransmit

c) Fast recovery

d) Congestion Avoidance
0
D?
0
Even I thought was D
The solution given is A

But the window size will increase exponentially in slow start isn't it?
0

You are right Vipin Rai

0
Thank you
0
I think the answer may vary according to the nature of acknowledgement .

If acknowledgement is always cumulative , then it's congestion avoidance , since every RTT window size increases by 1 only.

If acknowledgement comes for every segment , then it is slow start phase , because let's say current window size is 4 , so acknowledgement comes for every segment , and window size increases per ack. So after 4 ack's , new window size is 8 . Thus per RTT window size increases exponentially.

Correct me if i went wrong somewhere.
0

Slow start (when window grows exponentially) is followed by Congestion avoidance phase after reaching threshold (when window grows linearly)

https://www.geeksforgeeks.org/computer-network-tcp-congestion-control/

0
How D can be the correct answer? After every ack cwnd=cwnd+1, it happens in the slow start phase.
0
0
No need to refer any link, after getting the acknowledgment if you are increasing window size by 1, then only it can grow exponentially. Ans will be A only.
0
Didn't get what you are trying to say.
0

https://gateoverflow.in/204088/gate2018-14

@utkarsh I think it should be option d

0

D) Congestion Avoidance.

The value for the congestion window size will be increased by one with each acknowledgement (ACK) received, effectively doubling the window size each round-trip time.

0

D) Congestion Avoidance.

The value for the congestion window size will be increased by one with each acknowledgement(ACK) received, effectively doubling the window size each round-trip time.

What you're telling is slow start phase ,

In congestion avoidance , per acknowledgement window size increases by 1/congestion window size.

## Related questions

1
147 views
For hierarchical routing with 4800 routers , if region and cluster sizes are chosen then min size of routing table for three layer hierarchy is
What is the Frame checksum in polynomial notation for data $x^{6}+x^{3}$ with polynomial generation 1011 ? How to solve this ?