Match routing terms...

$$ the simplest routing$-$update algorithm, used by the Routing Information Protocol, or RIP avoids routing loops by the introduction of sequence numbers

$$ a technique for combining two $($or more$)$ routes to a destination into a single unit, so that traffic to that destination is distributed $($not necessarily equally$)$ among the routes.

$3$ messages circulate only if a link breaks, or when a node is looking for a route to some other node

$$

has been chosen for the IEEE $802\mathrm{.}11$s Wi$-$Fi mesh networking standard often $-$ though certainly not always $-$ considered to be the routing$-$update algorithm class of choice for networks that are "sufficiently large", such as those of ISPs. eliminates the risk of routing loops, even ephemeral ones. It is based on the "distributed update algorithm" $($DUAL$).$