Computer Networks
Opening a connection…
Initializing Sorting Algorithms...
Sorting
Trees
Graphs
Preparing interactive visualizations...
Computer Networks
Opening a connection…
How fast should a sender go on a network it cannot see? Probe upward, back off on loss — and watch the congestion window saw.
Round 1: segments 1–1 in flight
The connection has just been established. cwnd starts at 1 segment and ssthresh at 16, a guess at where the network's capacity lies. Round 1: cwnd = 1, ssthresh = 16 (slow start). All 1 segment is acknowledged. In slow start each ACK grows cwnd by one segment, so the window doubles every round trip: 1 → 2.
Click a round to cycle: no loss → three duplicate ACKs (amber) → timeout (red).
Real stacks start with ssthresh effectively unlimited, so the first loss ends slow start; most of Linux today runs CUBIC, which keeps this loss response but grows cwnd along a cubic curve.
Question 1 of 3
A TCP Reno sender has cwnd = 20 segments when three duplicate ACKs arrive. What are ssthresh and cwnd afterwards (ignoring the temporary +3 inflation)?