Try a question

Answer it here to see how it works. Nothing is recorded until you sign in.

Question 1

2026 Slot Set2 PYQ

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: 1 M = 1 0^{6}, 1 k = 1 0^{3}

Question 2

2024 Slot Set1 PYQ

Consider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size 1 0^{6} bytes to R via this path by splitting the file into chunks of 1 0^{3} bytes each. Node P sends these chunks one after the other without any wait time between the successive chunk transmissions. Assume that the size of extra headers added to these chunks is negligible, and that the chunk size is less than the MTU. Each of the links P—Q and Q—R has a bandwidth of 1 0^{6} bits/sec, and negligible propagation latency. Router Q immediately transmits every packet it receives from P to R, with negligible processing and queueing delays. Router Q can simultaneously receive on link P—Q and transmit on link Q—R. Assume P starts transmitting the chunks at time t = 0 . Which one of the following options gives the time (in seconds, rounded off to 3 decimal places) at which R receives all the chunks of the file?

Question 3

2022 PYQ

Consider a 100 Mbps link between an earth station (sender) and a satellite (receiver) at an altitude of 2100 km. The signal propagates at a speed of 3 x 1 0^{8} m/s. The time taken (in milliseconds, <i>rounded off to two decimal places</i>) for the receiver to completely receive a packet of 1000 bytes transmitted by the sender is___________.

Network Delay, Throughput and End-to-End Performance PYQs for GATE CS

Solve 3+ Network Delay, Throughput and End-to-End Performance previous year questions for GATE CS with answers and detailed solutions. Free sample questions below.

Chapter Roadmap: Network Delay and Throughput

Network Delay, Throughput & Performance

Mastering the mathematics of data movement.

Your Learning Journey

Store-and-Forward & Bottleneck Throughput

Understand how routers process packets, the concept of store-and-forward delay, and how the slowest link determines the maximum throughput of a path.

High Importance

Transmission and Propagation Delay

Distinguish between the time to push bits onto the link and the time for signals to travel through the medium. Master the total delay formula.

Core Concept

Store-and-Forward Transfer and Bottleneck Throughput

Store-and-Forward & Bottlenecks

How routers process packets and why the slowest link defines your speed.

Context

Computer Networks › Network Delay and Throughput › Store-and-Forward Transfer

What you will learn here

The mechanism of store-and-forward switching in routers.
How to calculate total transfer time for single and multiple packets.
The concept of bottleneck bandwidth and its effect on end-to-end throughput.
Solving multi-hop transfer problems with pipelining effects.

Network Delay, Throughput and End-to-End Performance: Solved Questions with Step-by-Step Explanations (3 Problems)

Question 1 · Computer Networks · 2026_Set2 MCQ

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:

1 M = 1 0^{6}

1 k = 1 0^{3}

A.
731
B.
64
C.
8
D.
16

Question 2 · Computer Networks · 2024_Set1 MCQ

Consider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size

1 0^{6}

bytes to R via this path by splitting the file into chunks of

1 0^{3}

bytes each. Node P sends these chunks one after the other without any wait time between the successive chunk transmissions. Assume that the size of extra headers added to these chunks is negligible, and that the chunk size is less than the MTU.

Each of the links P—Q and Q—R has a bandwidth of

1 0^{6}

bits/sec, and negligible propagation latency. Router Q immediately transmits every packet it receives from P to R, with negligible processing and queueing delays. Router Q can simultaneously receive on link P—Q and transmit on link Q—R.

Assume P starts transmitting the chunks at time

t = 0

.
Which one of the following options gives the time (in seconds, rounded off to 3 decimal places) at which R receives all the chunks of the file?

A.
$8.000$
B.
$8.008$
C.
$15.992$
D.
$16.000$

Question 3 · Computer Networks · 2022 NAT

Consider a 100 Mbps link between an earth station (sender) and a satellite (receiver) at an altitude of 2100 km. The signal propagates at a speed of $3 x 1 0^{8}$ m/s. The time taken (in milliseconds, <i>rounded off to two decimal places</i>) for the receiver to completely receive a packet of 1000 bytes transmitted by the sender is___________.

Try a question

Login to view the complete previous-year questions and solutions

Personalised first. High quality throughout.

Built around you, not around a syllabus PDF

Revision that hits your weak spots

Questions calibrated to the real exam

Notes written for recall, not for volume

One place for everything

Honest progress

Unlock the whole course