Dynamic routing protocols. What is the difference between link state and distance vector? Can you explain for the dumb?

Question

Computer networks

I read about OSPF, EIGRP and BGP, tried to understand what and how, and met the phrases "link state" and "distance vector" there.
I tried to google what they mean and what is the difference and I didn’t understand :-(
Maybe someone smart will explain?

Answer 1

Everything is simple.
Distance vector (dva) send to neighbors all entries from their routing table and the calculated metric value for each of them. It turns out two long vectors - the routes themselves and the metric for each. Each router knows only its neighbor's routing table.
Link states (lsa) send only their direct-connected networks with some pre-specified metric to their neighbors, and invariably forward the same messages from their other neighbors. Each router, through all this information, knows all the routers in the network, the networks connected to them, and the value of the metrics for each of them.
It is believed that dva (even pure ebgp is simpler than ospf / isis) is much simpler and more predictable than lsa, more controlled (read safe), since in the first case no tricky path selection algorithms are launched and you can control the policy of routing information announcements for each neighbor.

Answer 2

link-state builds routing based on the topology of the entire network, distance-vector builds based on routes from neighbors, they do not monitor the state of the entire network