Distance-vector routing protocol

Distance vector is exchanged

vulnerable to routing loop unlike

Single-hop loop problem

A single hop loop occurs when a node receives its own distance table from a neighbor, resulting in a loop in the routing information.

Multi-hop loop problem

Multiple hop loops can occur when changes in network topology are not reflected quickly, as updates are spread node-by-node. Implementing mechanisms to propagate updates more effectively and ensuring that changes are reflected in a timely manner can help mitigate the occurrence of multiple hop loops

Distance-vector routing protocol

A distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information. Distance-vector routing protocols also require that a router inform its neighbours of network topology changes periodically.

https://en.wikipedia.org/wiki/Distance-vector_routing_protocol

Distance-vector routing protocol

Distance vector is exchanged

Single-hop loop problem

Multi-hop loop problem

Recommendations