← Quiz: Routing Algorithms: all 10 questions
Quiz: Routing Algorithms · Question 5 of 10
What is the count-to-infinity problem?
What is the count-to-infinity problem?
- A.Routing tables grow without limit
- B.Dijkstra never finishes on large graphs
- C.After a link fails, distance-vector routers keep increasing their distances by learning stale routes from each other
- D.Packets get a TTL of infinity
Answer & explanation
Correct answer: After a link fails, distance-vector routers keep increasing their distances by learning stale routes from each other
Bad news spreads slowly because routers believe routes that pass through themselves.
Can you get the rest right without peeking?
Take the timed Quiz: Routing Algorithms quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →