Distance vector–based routing algorithms (also known as Bellman-Ford-Moore algorithms) pass periodic copies of a routing table from router to router and accumulate distance vectors.

Link state algorithms converge more quickly than distance vector algorithms, but this typically require more memory and CPU processing than distance vector algorithms. The netWorks application ...

In this paper, the authors survey the public presentation between two adaptive routing algorithms: Link State Algorithm (LSA), which is centralized algorithm and Distance Vector Algorithm (DVA ...

These protocols are like DSR (Dynamic Source Routing), AODV (Ad-hoc On-demand Distance Vector routing algorithm) and TORA (Temporally Ordered Routing Algorithm) like more.