Skip to content

GATE CS 2009 Q58 — Transport Layer: Flow Control, Congestion Control, UDP, TCP, Sockets

Explain with AI

Frames of 1000 bits1000\text{ bits} are sent over a 10610^6 bps duplex link between two hosts. The propagation time is 25ms25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).

Let II be the minimum number of bits (I)(I) that will be required to represent the sequence numbers distinctly assuming that no time gap needs to be given between transmission of two frames.

Suppose that the sliding window protocol is used with the sender window size of 2I2^{I}, where II is the numbers of bits as mentioned earlier and acknowledgements are always piggy backed. After sending 2I2^I frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time)

Choose one option
View worked solution

Answer: C

To find the waiting time of the sender, we first determine the value of II and then calculate the timeline of transmission and acknowledgment.

Step 1: Find the number of bits II

  • Transmission time of a frame (TtT_t) = 1000 bits106 bps=1 ms\frac{1000\text{ bits}}{10^6\text{ bps}} = 1\text{ ms}
  • Propagation delay (TpT_p) = 25 ms25\text{ ms}

The maximum number of frames that can be in transit (within the link in one direction) is given by the bandwidth-delay product:

Frames in transit=Bandwidth×TpFrame size=106×25×10−31000=25 frames\text{Frames in transit} = \frac{\text{Bandwidth} \times T_p}{\text{Frame size}} = \frac{10^6 \times 25 \times 10^{-3}}{1000} = 25\text{ frames}

To represent these 2525 frames distinctly, we need II bits such that:

2I≥25  ⟹  I=5 bits(since 25=32≥25)2^I \ge 25 \implies I = 5\text{ bits} \quad (\text{since } 2^5 = 32 \ge 25)

Step 2: Calculate the waiting time

The sender window size is 2I=322^I = 32 frames.

  • Transmission of 32 frames: The sender starts transmitting frame 00 at t=0t = 0 and finishes transmitting the 32nd32^{\text{nd}} frame (frame 3131) at t=32×1 ms=32 mst = 32 \times 1\text{ ms} = 32\text{ ms}.
  • Arrival of the first ACK:
    • Frame 00 transmission finishes at t=1 mst = 1\text{ ms}.
    • It reaches the receiver at t=1+25=26 mst = 1 + 25 = 26\text{ ms}.
    • Since acknowledgements are piggybacked, the reverse frame (carrying the ACK) takes 1 ms1\text{ ms} to transmit, finishing at t=26+1=27 mst = 26 + 1 = 27\text{ ms}.
    • The ACK arrives back at the sender at t=27+25=52 mst = 27 + 25 = 52\text{ ms}.

The sender must wait from the moment it finishes transmitting the window (t=32 mst = 32\text{ ms}) until it receives the first ACK (t=52 mst = 52\text{ ms}):

Waiting time=52 ms−32 ms=20 ms\text{Waiting time} = 52\text{ ms} - 32\text{ ms} = 20\text{ ms}

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Transport Layer: Flow Control, Congestion Control, UDP, TCP, Sockets questions