0
Which routing algorithm is based on the Bellman-Ford algorithm and is prone to the "count-to-infinity" problem?
- AOSPF (Link State)
- BRIP (Distance Vector)
- CBGP (Path Vector)
- DIS-IS (Link State)
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!