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

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$

The correct answer is
64

Calculating File Transfer Time Over Network Links

The total time required to transfer a file is determined by the file size and the effective transfer rate across the network path. Since the path has multiple links, the overall transfer rate is limited by the link with the lowest bandwidth, known as the bottleneck bandwidth.

Step 1: Convert File Size to Bits

The file size is given as 4 million bytes.

  • File Size = $4 \times 10^6$ bytes
  • To convert bytes to bits, multiply by 8:
  • File Size in bits = $4 \times 10^6 \text{ bytes} \times 8 \text{ bits/byte} = 32 \times 10^6$ bits

Step 2: Convert Link Bandwidths to bps

The bandwidths of the three consecutive links are:

  • Link 1: 2 Mbps = $2 \times 10^6$ bits per second (bps)
  • Link 2: 500 kbps = $500 \times 10^3$ bps = $0.5 \times 10^6$ bps
  • Link 3: 1 Mbps = $1 \times 10^6$ bps

Step 3: Identify the Bottleneck Bandwidth

The transfer rate is limited by the slowest link. Comparing the bandwidths:

  • $2 \times 10^6$ bps
  • $0.5 \times 10^6$ bps
  • $1 \times 10^6$ bps

The minimum bandwidth is $0.5 \times 10^6$ bps (from the 500 kbps link). This is the bottleneck bandwidth.

Step 4: Calculate Total Transfer Time

Total Transfer Time = File Size (in bits) / Bottleneck Bandwidth (in bps)

  • Transfer Time = $\frac{32 \times 10^6 \text{ bits}}{0.5 \times 10^6 \text{ bps}}$
  • Transfer Time = $\frac{32}{0.5}$ seconds
  • Transfer Time = 64 seconds

Since processing and propagation delays are negligible, the total transfer time is solely the time taken to transmit the file data over the bottleneck link.

Was this answer helpful?

Important Questions from Flow Control

  1. 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?
  2. A computer modem's rating of 56 K refers to its-

  3. 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: 

  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