Back to the 2020 paper

Module 4: Transport Layer & Congestion Control

20207m

A TCP connection is using a window size of 10,000 bytes, and the previous acknowledgment number was 22,001. It receives a segment with acknowledgment number 24,001 and window size advertisement of 12,000. Draw a diagram to show the situation of the window before and after.

Worked SolutionAI Assisted

TCP Sliding Window — Before and After the ACK

Given: previous ACK number (left edge of window) = 22,001, window size = 10,000 bytes. A segment arrives with ACK = 24,001 and window advertisement = 12,000.

Before

  • Left edge (SND.UNA) = 22,001 → bytes < 22,001 are already acknowledged.
  • Right edge = 22,001 + 10,000 − 1 = 32,000 → sender may transmit bytes 22,001 … 32,000.
 byte:  ... 21999 | 22001 22002 ............ 32000 | 32001 32002 ...
                  |<-------- window = 10,000 bytes --------->|  cannot
        ACKed      ^ SND.UNA                         right edge   send
                   (next byte expected by receiver = 32,001)

After (ACK = 24,001, new window = 12,000)

  • Bytes 22,001 – 24,000 (2,000 bytes) are now acknowledged → they leave the window.
  • New left edge = 24,001.
  • New right edge = 24,001 + 12,000 − 1 = 36,000.
  • The window has effectively slid forward by 2,000 bytes and grown by 2,000 bytes, opening 4,000 bytes of new sendable space at the right edge.
 byte:  ... 24000 | 24001 24002 ............ 36000 | 36001 36002 ...
                  |<-------- window = 12,000 bytes --------->|  cannot
        ACKed      ^ SND.UNA (new)                right edge     send
                   (next byte expected = 36,001)

Summary

Item Before After
ACK / left edge 22,001 24,001
Window size 10,000 12,000
Last byte in window 32,000 36,000
Bytes newly acknowledged — 22,001 – 24,000 (2,000 B)
Newly sendable bytes — 32,001 – 36,000 (4,000 B)

The sender may now transmit bytes 24,001 through 36,000 (12,000 bytes total, including any already sent but unacknowledged), and it must keep SND.NXT ≤ 36,001.

Similar questions

Computer NetworksDraw and describe the TCP header. Assume that a host receives a UDP segment with 01011101 11110010 (we separated the values of each byte with a space for clarity) as the checksum. The host adds the 16-bit words over all necessary fields excluding the checksum and obtains the value 00110010 00001101. Is the segment considered correctly received or not? What does the receiver do?202114mComputer NetworksConsider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.20167mComputer NetworksAn IP datagram is carrying a TCP segment destined for address 130.14.16.17/16. The destination port address is corrupted, and it arrives at destination 130.14.16.19/16. How does the receiving TCP react to this error? Show the entries for the header of a TCP segment that carries a message from an FTP client to an FTP server. Fill the checksum field with Os. Choose an appropriate ephemeral port number and the correct well-known port number. The length of the data is 40 bytes.20207mComputer NetworksConsider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a time-out occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission. (i) 8 MSS (ii) 14 MSS (iii) 7 MSS (iv) 12 MSS20212m
Budget AppAndroid App

Pocketly on Android

Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.