What problem is avoided through the use of modern distance-vector routing protocols like EIGRP?
Correct Incorrect Unanswered
Answer Description
Routing loops are the product errors in the operation of a routing algorithm. New distance-vector routing algorithms have built-in loop prevention that makes routing loops impossible.
Wikipedia
A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop.In the simplest version, a routing loop of size two, node A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A.
Thus, whenever traffic for C arrives at either A or B, it will loop endlessly between A and B, unless some mechanism exists to prevent that behaviour.
Routing_loop - Wikipedia, the free encyclopedia 