All Exams Test series for 1 year @ ₹349 only
Question

Suppose we are transmitting frames between two nodes using Stop-and-Wait protocol. The frame size is 3000 bits. The transmission rate of the channel is 2000 bps (bits/second) and the propagation delay between the two nodes is 100 milliseconds. Assume that the processing times at the source and destination are negligible. Also, assume that the size of the acknowledgement packet is negligible.
Which ONE of the following most accurately gives the channel utilization for the above scenario in percentage?

The correct answer is
88.23

Stop-and-Wait Protocol Channel Utilization Calculation

This solution details the calculation of channel utilization for the Stop-and-Wait protocol based on the provided network parameters.

Given Parameters

The problem provides the following details:

  • Frame Size (L): 3000 bits
  • Transmission Rate (R): 2000 bits per second (bps)
  • Propagation Delay (Tp): 100 milliseconds (ms)

Key assumptions mentioned are:

  • The size of the acknowledgement (ACK) packet is negligible.
  • Processing times at both the source and destination nodes are negligible.

Understanding Channel Utilization in Stop-and-Wait

Channel utilization represents how effectively the communication channel is being used to transmit data. In the Stop-and-Wait protocol, efficiency is limited because the sender transmits one frame and then must wait for an acknowledgement before sending the next. The total time cycle for transmitting a single frame and receiving its acknowledgement determines the utilization.

Calculating Transmission and Cycle Times

First, we need to determine the time it takes to transmit a single frame ($T_{tx}$) and the total time for one complete cycle ($T_{cycle}$).

The time required to transmit the frame is calculated as:

$ T_{tx} = \frac{L}{R} $

Given $L = 3000$ bits and $R = 2000$ bps:

$ T_{tx} = \frac{3000 \text{ bits}}{2000 \text{ bps}} = 1.5 \text{ seconds} $

The total cycle time ($T_{cycle}$) in Stop-and-Wait includes the transmission time of the frame, the propagation delay for the frame to reach the receiver, and the propagation delay for the acknowledgement to return to the sender. Since the ACK packet size and processing times are negligible, the formula for the cycle time is:

$ T_{cycle} = T_{tx} + T_{prop} (\text{frame}) + T_{prop} (\text{ACK}) $

Given $T_{prop} (\text{frame}) = T_{prop} (\text{ACK}) = T_p = 100 \text{ ms} = 0.1 \text{ s}$:

$ T_{cycle} = T_{tx} + 2 \times T_p $

Substituting the calculated $T_{tx}$ and the given $T_p$:

$ T_{cycle} = 1.5 \text{ s} + 2 \times (0.1 \text{ s}) $

$ T_{cycle} = 1.5 \text{ s} + 0.2 \text{ s} = 1.7 \text{ seconds} $

Determining Channel Utilization

The channel utilization ($\eta$) is the ratio of the useful transmission time ($T_{tx}$) to the total cycle time ($T_{cycle}$).

$ \eta = \frac{T_{tx}}{T_{cycle}} $

Substituting the values we calculated:

$ \eta = \frac{1.5 \text{ s}}{1.7 \text{ s}} $

$ \eta \approx 0.8823529 $

To express the utilization as a percentage, we multiply by 100:

$ \eta \% = \eta \times 100 \% $

$ \eta \% \approx 0.8823529 \times 100 \% \approx 88.235 \% $

Rounding to two decimal places, the channel utilization is approximately 88.23%.

Conclusion

The calculation shows that the channel utilization for the given scenario using the Stop-and-Wait protocol is approximately 88.23%.

Was this answer helpful?

Important Questions from Flow Control

  1. A computer modem's rating of 56 K refers to its-

  2. The Solution to Silly Window Syndrome problem is/are:

    A. Nagle's Algorithm

    B. Clark's Algorithm

    C. Jacobson's Algorithm

    D. Piggy backing Algorithm

    Choose the correct answer from the options given below: 

  3. Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other additional overhead to transfer the file.

    Which one of the following is the total time (in seconds) to transfer the file?
    Note: 1M=$10^6$, 1k=$10^3$

  4. Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?

  5. Sequence the following stages of the sliding window protocol for flow control.

    A. Sender move the window to the next set of frames.

    B. Sender sends a window of frames.

    C. Receiver acknowledge the received frames.

    D. If acknowledgment is not received, Sender retransmits the frame.

    Choose the correct answer from the options given below:

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App