Question

Briefly contrast the cost metrics between distance vector routing algorithms and link state routing algorithms for building routing tables, and briefly compare two major routing protocols that use them.

Answer 1

In case of the distance vector routing protocol, it uses the bellman-ford as the algorithm and it gets the information of the whole anonymous system and based on which it calculates the cost and the shortest path between one another. It calculates the shortest path based on the least number of hops.

But in case of the link state routing algorithm, it uses Dijkstra's algorithm and it gets the information of every neighbors and then calculates the shortest distance between one another. It calculates the least distance based on the cost.

RIP, routing information protocol, which uses the distance vector routing as the algorithm.
OSPF, Open shortest path first, uses the link state algorithm.

Friend: If you have any doubt regarding the solution to the problem, do let me know in the comment section.
Thanks