In the slow start phase of the TCP congestion control algorithm, the size of the congestion window: (i) does not increase (ii) increases linearly (iii) increases quadratically (iv) increases exponentially

In the slow start phase of the TCP congestion control algorithm, the size of the congestion window: (i) does not increase (ii) increases linearly (iii) increases quadratically (iv) increases exponentially

Verified Sources
Nov 4, 2026

In TCP congestion control, the slow start phase increases the sender’s congestion window (cwnd) rapidly until it reaches a threshold (ssthresh). In the typical textbook model, during slow start the congestion window effectively doubles every RTT, which corresponds to exponential growth in time measured in RTTs. That makes option (iv) increases exponentially the correct choice.

Key idea: cwnd growth is driven by acknowledgments; in slow start, cwnd is increased by (approximately) one maximum segment size per ACK, which results in roughly doubling per round-trip when packet acknowledgments for the flight are received together—hence exponential growth in RTT rounds.

A useful way to see this is to model the number of packets in flight. If cwnd starts at w0w_0 packets and doubles each RTT, then after kk RTTs you have:

wk=w0⋅2kw_k = w_0 \cdot 2^k

This is exponential in kk (the RTT index).

Mermaid overview of where slow start sits in TCP congestion control:

congestion window slow start ssthresh RTT

TCP Slow Start (Conceptual) — Congestion Window Growth

Correct multiple-choice answer

(iv) increases exponentially

Reasoning: In slow start, the congestion window increases so that the amount of data in flight grows roughly by a factor of 2 each RTT (because cwnd increases by about one MSS per ACK, over a flight whose size itself is increasing). This produces exponential growth across RTT rounds rather than linear or quadratic growth.

exponential growth linear growth quadratic growth

Deriving exponential cwnd growth in slow start (RTT-based view)

  1. 1
    Step 1

    Let the congestion window start at w0w_0 MSS-sized segments (or proportional bytes).

  2. 2
    Step 2

    TCP transmits approximately w0w_0 segments; acknowledgments begin to arrive.

  3. 3
    Step 3

    As ACKs are received, cwnd is incremented (commonly approximated as ≈1\approx 1 MSS per ACK), so cwnd grows while the flight is being acknowledged.

  4. 4
    Step 4

    After one RTT, the number of in-flight segments that can be sent is approximately doubled: w1≈2w0w_1 \approx 2w_0.

  5. 5
    Step 5

    After kk RTTs, wk≈w0⋅2kw_k \approx w_0 \cdot 2^k, which is exponential in kk (RTT index).

How to recognize exponential growth fast

If the cwnd roughly doubles each RTT, that corresponds to 2k2^k growth (exponential), not kk (linear) or k2k^2 (quadratic).

Precision note (implementation details)

Real TCP behavior is affected by delayed ACKs, packet loss, and byte-vs-segment accounting. But the slow start concept is intentionally designed to grow cwnd rapidly—commonly summarized as doubling per RTT until ssthresh.

Conceptual cwnd growth in slow start (RTT rounds)

Exponential model: wk=w0⋅2kw_k = w_0 \cdot 2^k

Where slow start fits in TCP congestion control

Initialize

Connection start

cwnd begins small (often using a configured initial value)."

Slow start

As ACKs arrive

cwnd grows rapidly (commonly summarized as doubling per RTT) until reaching ssthresh."

Congestion avoidance

cwnd reaches ssthresh

TCP typically switches to a more conservative growth rule (often additive increase)."

Common confusions about the growth rate

TCP Slow Start Quick Checks

1 / 4
Question · Term

In slow start, cwnd generally grows by what pattern across RTTs?

Click to reveal
Answer · Definition

It’s commonly summarized as roughly doubling each RTT (exponential across RTT rounds).

Knowledge Check

Question 1 of 4
Q1Single choice

In the slow start phase of the TCP congestion control algorithm, the size of the congestion window: does not increase / increases linearly / increases quadratically / increases exponentially