· Fast convergence of the network is critical
· The network is very large
Distance vector protocols compute their routing tables before sending routing updates; link-state protocols do not.
(*)Fast convergence of the network is critical.(*)The network is very large.
I think the answer is the state of each directly connecyed link.
They require more memory and processing power to run on the router.They require more memory and processing power to run on the router.They require more memory and processing power to run on the router.They require more memory and processing power to run on the router.
shotrest path first calculation
Link-state advertisements (LSAs) -- A link-state advertisement (LSA) is a small packet of routing information that is sent between routers.Topological database -- A topological database is a collection of information gathered from LSAs.SPF algorithm (Dijkstra algorithm) -- The shortest path first (SPF) algorithm is a calculation performed on the database resulting in the SPF tree.Routing tables -- A list of the known paths and interfaces.Link State Routing Protocols converge more quickly and they are less prone to routing loops than Distance Vector algorithms. On the other hand, Link State Routing Protocols require more CPU power and memory than distance vector algorithms. Link State Protocols use a hierarchical structure that limits the distance that a Link-State Advertisement (LSA) need to travel. Link State Protocols use multicasts to share the routing information. Only the routers which run Link State protocol only process the updates. Link State routers send updates only when there is a change in the state of the network (incremental updates).
Distance vector protocols exchange their routing tables, and add a metric to each route. Link-state routing protols exchange topology information, then calculate the routes. As a result, there are the following fundamental differences:The information that is exchanged - routing table vs. topology information.Link-state protocols know the topology of the network (or an area); distance vector routing protocols don't.When the best route is calculated: in distance-vector routing protocols, a metric is added while the route is propagated from router to router. In link-state protocols, the best route is calculated separately by each router, only after having complete topology information.
Dijkstra
It is because it segments the network into area hierarchies
Link-state routing algorithms, also known as shortest path first (SPF) algorithms.
The state of directly connected links
Elementary data link protocols must agree at the most rudimentary level. The data frame must be constructed from this level, and all protocols must agree.