The sender initializes its congestion window (cwnd) to 1 and slow start threshold (ssthresh) to 8. The receiver is ready to accept packets starting at sequence number 1.
💡 Setting initial cwnd and ssthresh is crucial to start TCP's congestion control and flow control mechanisms.
💡 Receiver acknowledges the next expected sequence number after the last received packet.
fill_cells
Send Final ACK for seq=8
Receiver sends the final ACK indicating it expects sequence number 8 next, confirming all sent packets were received.
💡 Final ACK confirms successful delivery of all packets in this window.
Line:send_ack(ack_num=8)
💡 Final ACK signals completion of this transmission phase.
traverse
Final ACK for seq=8 Arrives at Sender
Sender receives the final ACK=8, confirming all packets sent were acknowledged. Congestion window is increased to 5.
💡 Final ACK confirms successful transmission; cwnd growth continues.
Line:receive_ack(ack_num=8)
cwnd = cwnd + 1
💡 TCP AIMD steadily increases cwnd to maximize throughput without causing congestion.
cwnd = 1 # STEP 1: Initialize congestion window
ssthresh = 8
next_seq_num = 1
ack_expected = 1
# STEP 2: Send first packet
send_packet(seq_num=next_seq_num)
# STEP 3-4: Receiver processes packet and sends ACK
# STEP 5: Sender receives ACK and increases cwnd
if ack_num > ack_expected:
ack_expected = ack_num
if cwnd < ssthresh:
cwnd += 1 # additive increase
# STEP 6: Send packets up to cwnd
while next_seq_num < ack_expected + cwnd:
next_seq_num += 1
send_packet(seq_num=next_seq_num)
# Repeat steps for receiving ACKs and increasing cwnd
# Final step: all packets acknowledged
📊
TCP Flow Control - Sliding Window & Congestion Control (AIMD) - Watch the Algorithm Execute, Step by Step
Watching the packet flow and window adjustments step-by-step reveals how TCP controls data transmission to avoid congestion and ensure reliable delivery, which is hard to grasp from code alone.
Step 1/17
·Active fill★Answer cell
Initialized sender cwnd=1, ssthresh=8; receiver ready for seq=1
Hop: 0
Sender
Receiver
Router1
Packet seq=1 sent, window size limits to 1 packet in flight
Hop: 1
Sender
Receiver
Router1
📦Packet
↗ fromsender
↘ toreceiver
📄 payloadseq=1
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=1
flags→DATA
Sent: seq=1 from sender to receiver
Receiver processed seq=1, preparing ACK for seq=2
Hop: 2
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ toreceiver
📄 payloadseq=1
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=1
flags→DATA
Sent: seq=1 from sender to receiver
Received: seq=1 at receiver
ACK for seq=2 sent, signaling successful receipt of seq=1
Hop: 3
Sender
Receiver
Router1
📦Packet
↗ fromreceiver
↘ tosender
📄 payloadack=2
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=2
flags→ACK
Sent: seq=1 from sender to receiver
Received: seq=1 at receiver
Sent: ack=2 from receiver to sender
Sender received ACK=2, cwnd increased from 1 to 2 (additive increase)
Hop: 4
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ tosender
📄 payloadack=2
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=2
flags→ACK
Received: seq=1 at receiver
Sent: ack=2 from receiver to sender
Received: ack=2 at sender
Sender sent packets seq=2 and seq=3 filling cwnd=2
Hop: 1
Sender
Receiver
Router1
📦Packet
↗ fromsender
↘ toreceiver
📄 payloadseq=2
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=2
flags→DATA
Received: ack=2 at sender
Sent: seq=2 from sender to receiver
Sent: seq=3 from sender to receiver
Receiver processed seq=2, preparing ACK for seq=4
Hop: 2
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ toreceiver
📄 payloadseq=2
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=2
flags→DATA
Sent: seq=2 from sender to receiver
Sent: seq=3 from sender to receiver
Received: seq=2 at receiver
ACK for seq=4 sent, acknowledging packets 2 and 3
Hop: 3
Sender
Receiver
Router1
📦Packet
↗ fromreceiver
↘ tosender
📄 payloadack=4
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=4
flags→ACK
Sent: seq=3 from sender to receiver
Received: seq=2 at receiver
Sent: ack=4 from receiver to sender
Sender received ACK=4, cwnd increased from 2 to 3 (additive increase)
Hop: 4
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ tosender
📄 payloadack=4
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=4
flags→ACK
Received: seq=2 at receiver
Sent: ack=4 from receiver to sender
Received: ack=4 at sender
Sender sent packets seq=4, 5, 6 filling cwnd=3
Hop: 1
Sender
Receiver
Router1
📦Packet
↗ fromsender
↘ toreceiver
📄 payloadseq=4
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=4
flags→DATA
Sent: seq=4 from sender to receiver
Sent: seq=5 from sender to receiver
Sent: seq=6 from sender to receiver
Receiver processed seq=4, preparing ACK for seq=7
Hop: 2
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ toreceiver
📄 payloadseq=4
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=4
flags→DATA
Sent: seq=5 from sender to receiver
Sent: seq=6 from sender to receiver
Received: seq=4 at receiver
ACK for seq=7 sent, acknowledging packets 4, 5, 6
Hop: 3
Sender
Receiver
Router1
📦Packet
↗ fromreceiver
↘ tosender
📄 payloadack=7
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=7
flags→ACK
Sent: seq=6 from sender to receiver
Received: seq=4 at receiver
Sent: ack=7 from receiver to sender
Sender received ACK=7, cwnd increased from 3 to 4 (additive increase)
Hop: 4
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ tosender
📄 payloadack=7
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=7
flags→ACK
Received: seq=4 at receiver
Sent: ack=7 from receiver to sender
Received: ack=7 at sender
Sender sent packet seq=7 filling cwnd=4
Hop: 1
Sender
Receiver
Router1
📦Packet
↗ fromsender
↘ toreceiver
📄 payloadseq=7
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=7
flags→DATA
Sent: ack=7 from receiver to sender
Received: ack=7 at sender
Sent: seq=7 from sender to receiver
Receiver processed seq=7, preparing ACK for seq=8
Hop: 2
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ toreceiver
📄 payloadseq=7
🔌 protocolTCP
🚩 flagsDATA
src→10.0.0.1:50000
dst→10.0.0.2:80
data→seq=7
flags→DATA
Received: ack=7 at sender
Sent: seq=7 from sender to receiver
Received: seq=7 at receiver
Final ACK for seq=8 sent, confirming all packets received
Hop: 3
Sender
Receiver
Router1
📦Packet
↗ fromreceiver
↘ tosender
📄 payloadack=8
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=8
flags→ACK
Sent: seq=7 from sender to receiver
Received: seq=7 at receiver
Sent: ack=8 from receiver to sender
Sender received final ACK=8, cwnd increased from 4 to 5
Hop: 4
Sender
Receiver
Router1
📦Packet
↗ fromrouter1
↘ tosender
📄 payloadack=8
🔌 protocolTCP
🚩 flagsACK
src→10.0.0.2:80
dst→10.0.0.1:50000
data→ack=8
flags→ACK
Received: seq=7 at receiver
Sent: ack=8 from receiver to sender
Received: ack=8 at sender
Key Takeaways
✓ TCP starts with a small congestion window and cautiously probes network capacity.
This cautious start prevents overwhelming the network and causing congestion early on.
✓ Additive Increase Multiplicative Decrease (AIMD) allows TCP to grow cwnd linearly when no loss occurs.
Watching cwnd increase step-by-step shows how TCP balances throughput and congestion avoidance.
2. Which of the following statements about Distance Vector routing is INCORRECT?
medium
A. Routers using Distance Vector routing have complete knowledge of the entire network topology
B. Distance Vector routing can suffer from the count-to-infinity problem causing slow convergence
C. Distance Vector routing updates are sent only to immediate neighbors
D. Split horizon and poison reverse are techniques used to prevent routing loops in Distance Vector
Solution
Step 1: Recall Distance Vector knowledge scope
Distance Vector routers only know routes advertised by neighbors, not the full network topology.
Step 2: Analyze each statement
Distance Vector routing can suffer from the count-to-infinity problem causing slow convergence is true; count-to-infinity is a known Distance Vector issue. Distance Vector routing updates are sent only to immediate neighbors is true; updates go only to neighbors. Split horizon and poison reverse are techniques used to prevent routing loops in Distance Vector is true; split horizon and poison reverse help prevent loops.
Step 3: Identify incorrect statement
Routers using Distance Vector routing have complete knowledge of the entire network topology is false because complete topology knowledge is a characteristic of Link State routing, not Distance Vector.
Final Answer:
Option A -> Option A
Quick Check:
Distance Vector routers have partial, neighbor-based knowledge only.
Hint: Full topology knowledge -> Link State, not Distance Vector
3. Which of the following statements about the OSI and TCP/IP models is INCORRECT?
medium
A. The OSI model has seven layers, while TCP/IP has four layers
B. The TCP/IP model includes a Presentation Layer separate from the Application Layer
C. The OSI model is a theoretical framework, whereas TCP/IP is a practical protocol suite
D. The Internet Layer in TCP/IP corresponds roughly to the Network Layer in OSI
Solution
Step 1: Analyze each statement carefully
Statement A is correct: OSI has 7 layers, TCP/IP has 4. Statement B is incorrect: TCP/IP does not have a separate Presentation Layer; it is combined with Application. Statement C is correct: OSI is theoretical, TCP/IP practical. Statement D is correct: Internet Layer maps to OSI's Network Layer.
Final Answer:
Option B -> Option B
Quick Check:
TCP/IP merges Presentation into Application Layer [OK]
Hint: TCP/IP merges Presentation into Application, no separate layer
Common Mistakes:
Assuming TCP/IP has all OSI layers distinctly
Confusing theoretical vs practical nature of models
Misaligning Internet and Network layers
4. If you have a network 10.0.0.0/8 and need to create subnets that support at least 1000 hosts each, which subnet mask would be the most appropriate and why?
hard
A. /22 because it provides 1022 usable hosts per subnet, balancing size and address waste
B. /24 because it is the default Class C mask and easy to manage
C. /20 because it provides 4094 usable hosts per subnet, which is more than needed but efficient
D. /30 because it minimizes IP address waste by creating very small subnets
Solution
Step 1: Calculate hosts per subnet for candidate masks
/20 -> 12 host bits -> 4094 usable hosts, more than needed but wastes addresses
Step 4: Check /30 mask
/30 -> 2 host bits -> 2 usable hosts, far too small
Step 5: Choose best fit
/22 provides just enough hosts with minimal waste, balancing efficiency and requirements.
Final Answer:
Option A -> Option A
Quick Check:
Subnet mask must provide ≥1000 hosts; /22 is minimal mask meeting this [OK]
Hint: Hosts per subnet = 2^(32 - mask) - 2
Common Mistakes:
Choosing default masks without considering host requirements
Picking too large subnets causing address waste
Selecting very small subnets ignoring host count needs
5. If a real-time chat application needs to support thousands of clients with intermittent connectivity and occasional message bursts, which limitation of WebSockets should be considered, and what fallback mechanism is most appropriate?
hard
A. WebSocket cannot handle intermittent connectivity; fallback to opening multiple WebSocket connections per client
B. WebSocket does not support message ordering; fallback to SSE to guarantee ordered delivery
C. WebSocket connections consume significant server resources per client; fallback to HTTP Long Polling to reduce persistent connections
D. WebSocket has high latency for message bursts; fallback to HTTP/2 multiplexing to improve throughput
Solution
Step 1: Identify WebSocket resource usage
Each WebSocket connection requires server resources to maintain persistent connections, which can be costly at scale.
Step 2: Consider intermittent connectivity
Clients with intermittent connectivity may cause connection drops, increasing server load.
Step 3: Evaluate fallback options
HTTP Long Polling can reduce persistent connections by using short-lived requests, making it a suitable fallback.
Step 4: Analyze other options
WebSocket does not support message ordering; fallback to SSE to guarantee ordered delivery is incorrect; WebSocket supports message ordering. WebSocket cannot handle intermittent connectivity; fallback to opening multiple WebSocket connections per client is wrong because opening multiple connections per client worsens resource usage. WebSocket has high latency for message bursts; fallback to HTTP/2 multiplexing to improve throughput misattributes latency issues to WebSocket and suggests unrelated HTTP/2 multiplexing.
Final Answer:
Option C -> Option C
Quick Check:
WebSocket resource cost + intermittent clients -> fallback to Long Polling
Hint: WebSocket scales poorly with many persistent connections; Long Polling reduces connection count
Common Mistakes:
Assuming WebSocket handles intermittent connectivity gracefully without resource impact
Believing WebSocket lacks message ordering
Confusing HTTP/2 multiplexing with WebSocket fallback
Recommended
Ready to prove it?
Pass the test and this pattern moves unknownstrongwhile earning +1 Grip toward your certificate.