Consider three routers A, B, and C connected as shown in the figure. The…
Consider three routers A, B, and C connected as shown in the figure. The routers exchange distance vector routing information and have converged on their routing tables. Now suppose the link between A and B fails. Which of the following avoids the two-node loop instability (count-to-infinity) problem?
- A.
If B sends its routing table to C before C sends its table to B.
- B.
If C sends its routing table to B before B sends its table to C.
- C.
If A sends its routing table to both B and C.
- D.
There is no way to avoid the two-node loop instability problem.
Attempted by 24 students.
Sign up free to check your answer
Sign up freeLoading lesson…