GATE 2022
Consider a network with three routers P, Q, R connected in a line (P-Q-R), shown below. All the links have cost of unity.
P --- Q --- R
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-∞ problem, is___________.