GATE CS 2022 (Forenoon) — Question 57

Computer Networks (CN)Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing)NAT2 marksMedium

Consider a network with three routers P, Q, R shown in the figure below. All the links have cost of unity.
Question image
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 __________.
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkComputer Networks (Tanenbaum)Layers, routing, TCP/IP and error control, explained clearly.
Practise more on Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group