The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay is t seconds per kilometer. Let B bits/second be the channel capacity. Assuming that the processing delay is negligible, the minimum number of bits required for the sequence number field in a frame for maximum utilization, when the sliding window protocol is used, is: A. [log_2(2BtL/K)] B. [log_2(2BtL/K + 1)] C. [log_2(BtL/K)] D. [log_2(2BtL/K - 1)]

GATE 2007 · Computer Networks · Sliding Window · medium

Answer: Minimum bits required = [log_2(2BtL/K)]. Answer: A. [log_2(2BtL/K)]

  1. Compute round-trip time and frames in pipe: RTT = 2tL seconds Number of frames in transit during RTT = (2tL) x B / K = 2BtL/K
  2. Find minimum sequence number bits: For window size W = 2BtL/K, the sequence number field needs at least ceil(log_2(2BtL/K)) bits. The ceiling (round up) is denoted [log_2(2BtL/K)].