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 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.
The file size is given as 4 million bytes.
The bandwidths of the three consecutive links are:
The transfer rate is limited by the slowest link. Comparing the bandwidths:
The minimum bandwidth is $0.5 \times 10^6$ bps (from the 500 kbps link). This is the bottleneck bandwidth.
Total Transfer Time = File Size (in bits) / Bottleneck Bandwidth (in bps)
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.
A computer modem's rating of 56 K refers to its-
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:
Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ?
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: