TCP flow control (sliding window) in Computer Networks - Time & Space Complexity

Time Complexity: TCP flow control (sliding window)

O(n / N)

Understanding Time Complexity

Analyzing time complexity helps us understand how TCP flow control manages data efficiently as network conditions change.

We want to know how the number of operations grows as the amount of data to send increases.

Scenario Under Consideration

Analyze the time complexity of the sliding window mechanism in TCP flow control.

window_size = N
while data_to_send:
    send_packets(window_size)
    wait_for_acknowledgments()
    slide_window_forward()
    update_window_size_based_on_receiver()

This code sends data packets in groups limited by the window size, waits for acknowledgments, then moves the window forward to send more.

Identify Repeating Operations

Look at what repeats as data is sent:

• Primary operation: Sending a batch of packets equal to the window size.
• How many times: The loop runs until all data is sent, roughly total data size divided by window size.

How Execution Grows With Input

As the total data size grows, the number of send-and-wait cycles increases proportionally.

Input Size (n packets)	Approx. Operations (send cycles)
10	About 10 / N cycles
100	About 100 / N cycles
1000	About 1000 / N cycles

Pattern observation: The total operations grow linearly with data size, but each cycle handles multiple packets based on window size.

Final Time Complexity

Time Complexity: O(n / N)

This means the time to send all data grows roughly in direct proportion to the amount of data divided by the window size.

Common Mistake

[X] Wrong: "Increasing the window size makes sending data instantaneous regardless of data size."

[OK] Correct: Even with a large window, data still must be sent and acknowledged in cycles, so time grows with data size.

Interview Connect

Understanding how TCP flow control scales with data size shows your grasp of network efficiency and resource management, a useful skill in many tech roles.

Self-Check

What if the window size dynamically shrinks during transmission? How would that affect the time complexity?

Practice

1. What is the main purpose of the sliding window in TCP flow control?

easy

A. To control the amount of data sent before receiving an acknowledgment

B. To encrypt data during transmission

C. To assign IP addresses to devices

D. To route packets between networks

Solution

1. Step 1: Understand the role of sliding window in TCP

   The sliding window limits how much data the sender can transmit before waiting for an acknowledgment from the receiver.

2. Step 2: Identify the purpose among options

   Only To control the amount of data sent before receiving an acknowledgment describes controlling data flow using acknowledgments, which matches the sliding window's purpose.

3. Final Answer:

   To control the amount of data sent before receiving an acknowledgment -> Option A

4. Quick Check:

   Sliding window controls data flow = To control the amount of data sent before receiving an acknowledgment [OK]

Hint: Sliding window limits unacknowledged data sent [OK]

Common Mistakes:

• Confusing flow control with encryption
• Mixing routing with flow control
• Thinking sliding window assigns IPs

2. Which of the following correctly describes the sliding window size in TCP?

easy

A. It is fixed and never changes during the connection

B. It is set by the IP address of the sender

C. It is always equal to the maximum segment size (MSS)

D. It increases or decreases based on acknowledgments received

Solution

1. Step 1: Recall how sliding window size behaves

   The window size changes dynamically as acknowledgments arrive, allowing the sender to send more data.

2. Step 2: Match behavior to options

   It increases or decreases based on acknowledgments received correctly states the window size adjusts based on acknowledgments, unlike fixed size or unrelated factors.

3. Final Answer:

   It increases or decreases based on acknowledgments received -> Option D

4. Quick Check:

   Window size changes with ACKs = It increases or decreases based on acknowledgments received [OK]

Hint: Window size changes with ACKs, not fixed [OK]

Common Mistakes:

• Assuming window size is fixed
• Confusing window size with MSS
• Linking window size to IP address

3. Consider a TCP connection with a window size of 4 segments. The sender has sent segments 1 to 4. The receiver acknowledges segment 2. Which segments can the sender send next?

medium

A. Segments 5, 6, and 7

B. Segments 3 and 4 again

C. Segments 5 and 6

D. No new segments until all are acknowledged

Solution

1. Step 1: Understand sliding window movement after ACK

   When segment 2 is acknowledged, the window slides forward, allowing sending of new segments beyond 4.

2. Step 2: Calculate which segments fit in the window

   Window size is 4, segments 1 and 2 acknowledged, so segments 3 and 4 are still unacknowledged. The sender can send segments 5 and 6 to fill the window.

3. Final Answer:

   Segments 5 and 6 -> Option C

4. Quick Check:

   ACK 2 slides window, send next 2 segments = Segments 5 and 6 [OK]

Hint: ACK moves window; send new segments within window size [OK]

Common Mistakes:

• Resending unacknowledged segments unnecessarily
• Sending more segments than window size allows
• Waiting for all segments to be acknowledged

4. A TCP sender has a window size of 3 segments and has sent segments 1, 2, and 3. The receiver sends an acknowledgment for segment 1 only. The sender mistakenly sends segment 4 and 5 immediately. What is the problem with this behavior?

medium

A. It violates the sliding window limit and may cause congestion

B. It improves throughput by sending more data

C. It is correct because ACK 1 means all previous segments are received

D. It causes the receiver to close the connection

Solution

1. Step 1: Analyze window size and ACK received

   The window size is 3, and only segment 1 is acknowledged, so segments 2 and 3 are still unacknowledged.

2. Step 2: Identify why sending segments 4 and 5 is wrong

   Sending segments 4 and 5 exceeds the allowed window size, risking congestion and data loss.

3. Final Answer:

   It violates the sliding window limit and may cause congestion -> Option A

4. Quick Check:

   Sending beyond window size causes issues = It violates the sliding window limit and may cause congestion [OK]

Hint: Don't send beyond window size before ACKs arrive [OK]

Common Mistakes:

• Assuming ACK 1 means all segments received
• Ignoring window size limits
• Thinking sending more data always helps

5. In a TCP connection, the sender's window size is 5 segments. The receiver's buffer can only hold 3 segments. How should the sliding window mechanism adapt to prevent buffer overflow?

hard

A. The sender should keep sending 5 segments regardless

B. The sender should reduce the window size to 3 segments

C. The receiver should increase its buffer size to 5 segments

D. The sender should stop sending any segments

Solution

1. Step 1: Understand receiver buffer limits

   The receiver can only hold 3 segments, so sending more than 3 risks overflow and data loss.

2. Step 2: Adjust sender window size accordingly

   The sliding window size must match or be less than the receiver's buffer to avoid overflow, so the sender should reduce its window size to 3.

3. Final Answer:

   The sender should reduce the window size to 3 segments -> Option B

4. Quick Check:

   Sender window ≤ receiver buffer to prevent overflow = The sender should reduce the window size to 3 segments [OK]

Hint: Match sender window to receiver buffer size [OK]

Common Mistakes:

• Ignoring receiver buffer size
• Assuming receiver buffer can always expand
• Stopping sending completely without reason