Medium ●●

🧱 Layering, Delays & Switching

Why it matters: Easy marks: which layer does what, how headers stack up, and end-to-end delay with transmission plus propagation over several hops.

Subtopics

Each subtopic has its own page: idea, why, how, example, play, check. Mark each one understood when it clicks. 0 of 4 done.

Formulas

Transmission delay
Tt = L / B
Propagation delay
Tp = d / v
One packet over k store-and-forward links
k · (L/B) + sum of Tp
n packets over k links (equal sizes)
(k + n − 1) · (L/B) + sum of Tp
Bandwidth-delay product
B × RTT (bits in the pipe)
Nyquist capacity
C = 2 H log2 V
Shannon capacity
C = H log2 (1 + S/N), S/N = 10^(dB/10)

What GATE asks from this

Question types seen repeatedly in past papers. More stars means more frequent.

★★★
Total delay of a file over several store-and-forward links
Count the packets and hops, use (k + n − 1) Tt plus the propagation delays. Check the unit prefixes.
★★★
Layer matching, PDU names, header field sizes
Which layer routes, frames, or does host-to-host delivery; sizes of port, MAC, sequence number fields.
★★★
How many times does a packet visit each layer
Hosts use all layers; each router uses layers 1 to 3 only. Count the link ends for layer 2.

Ratings are approximate, based on recurring patterns in past GATE CSE papers.

Previous year questions

7 real questions from the official GATE CSE papers (2012 to 2025), newest first, each with the official answer key and a worked solution. Questions are the property of the GATE organising institutes; this copy is for your personal study.

7 questions · 0 correct of 0 attempted · marks 0 / 10

Year:
GATE 2025 CS1 · Q16MCQ1 mark
Identify the ONE CORRECT matching between the OSI layers and their corresponding functionalities as shown. OSI layers: (a) Network layer, (b) Transport layer, (c) Datalink layer. Functionalities:
(I) Packet routing,
(II) Framing and error handling,
(III) Host to host communication.
GATE 2024 CS1 · Q36MCQ2 marks
Consider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size 106 bytes to R via this path by splitting the file into chunks of 103 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 106 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. At what time (in seconds, rounded off to 3 decimal places) does R receive all the chunks of the file?
GATE 2022 · Q59NAT2 marks
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 × 108 m/s. The time taken (in milliseconds, rounded off to two decimal places) for the receiver to completely receive a packet of 1000 bytes transmitted by the sender is ______.
GATE 2018 · Q13MCQ1 mark
Match the following. Field: P. UDP header's port number, Q. Ethernet MAC address, R. IPv6 next header, S. TCP header's sequence number. Length in bits: I. 48, II. 8, III. 32, IV. 16.
GATE 2013 Code A · Q14MCQ1 mark
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
GATE 2012 Code A · Q10MCQ1 mark
The protocol data unit (PDU) for the application layer in the Internet stack is
GATE 2012 Code A · Q44MCQ2 marks
Consider a source computer (S) transmitting a file of size 106 bits to a destination computer (D) over a network of two routers (R1 and R2) and three links (L1, L2, and L3). L1 connects S to R1; L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of length 100 km. Assume signals travel over each link at a speed of 108 meters per second. Assume that the link bandwidth on each link is 1 Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D?

Common traps

"Bandwidth 1 Mbps" is 10⁶ bits/s, not 2²⁰.
In pipelined store-and-forward the propagation delays add up, but the transmission time is (k + n − 1) packets, not k × n.
A router changes the data link header at every hop; the IP addresses stay the same (without NAT).
Shannon uses the S/N ratio, not the dB value.