GATE CSE 2022 Q57: Probability of a routing loop after link failure in distance vector
- Computer Networks
- 2 marks
- NAT
- No negative marking
Question
Consider a network with three routers P, Q, R shown in the figure below. All the links have cost of unity.

The routers exchange distance vector routing information and have converged on the routing tables, after which the link Q−R fails. Assume that P and Q send out routing updates at random times, each at the same average rate. The probability of a routing loop formation (rounded off to one decimal place) between P and Q, leading to count-to-infinity problem, is___________.
Try it: numerical answer: type the value
Show answer and explanation
Answer: 0.5 (official GATE 2022 final answer key)
Concept used: Count-to-infinity starts if P's stale route to R (via Q) reaches Q before Q's "R unreachable" update reaches P.
First step: After the failure, either P or Q sends its next update first, each with probability ; decide which order creates the loop.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2022 CS question paper and final answer key, organised by IIT Kharagpur. Question paper · Answer key
More Computer Networks PYQs
- 2026 Session 1 · Q18True statement about TCP connection setup and closing
- 2026 Session 1 · Q19HTTP 1.1 persistent connections and pipelining
- 2026 Session 1 · Q44When segment 2000 is sent under TCP slow start
- 2026 Session 1 · Q45Minimum sliding window size for full link utilisation
- 2026 Session 1 · Q56Valid CIDR blocks for 6000 addresses inside 202.16.0.0/15
- 2026 Session 2 · Q21File transfer time over three links of different bandwidth