Comparison between link status routing algorithms and Distance Vector Routing Algorithms

1. Message complexity

LsAlgorithmO (NE) n is the number of nodes in the network, and E is the number of links. When the cost of each link changes, the new link fee must be sent to all nodes.
When the link fee of the DV algorithm changes, the DV algorithm only changes when the new link fee causes the lowest cost path of the node associated with the link to change, to spread the changed link fee.

2. Convergence Speed

Ls O (N ^ 2)
The DV algorithm is slow to converge (depending on the related path cost) and may encounter a selective loop during convergence. DV algorithms also encounter endless counting problems.

3. robustness

In the LS algorithm, route computing is relatively independent and robust;
DV, a node can publish its incorrect lowest cost path to any or all target nodes. This will cause other routers to flow a lot of communication to the faulty router and cause most network connections to be interrupted. Generally, the computing value of a node in the DV algorithm is transmitted to its neighbor during each iteration, and then to the neighbor's neighbor during the next iteration. In this case, an incorrect node computing value in the DV algorithm will spread to the entire network.

In short, no algorithm is "Winner" for another algorithm ". The algorithms are applied on the Internet.