0
· Fast convergence of the network is critical
· The network is very large
Add your answer:
Earn +20 pts
Why do link-state protocols converge faster than most distance vector protocols?
Distance vector protocols compute their routing tables before sending routing updates; link-state protocols do not.
Which two situations require the use of a Link-state protocols?
(*)Fast convergence of the network is critical.(*)The network is very large.
What information is contained in LSPs sent by link-state protocols over distance vector protocols?
I think the answer is the state of each directly connecyed link.
What is one disadvantage of link-state protocols over distance vector protocols?
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.
What is associated with link-state routing protocols?
shotrest path first calculation
How are LSAs used to manage updates to the routing topology in a link state protocol environment?
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).
What is one fundamental difference between distance vector routing protocols and link state routing protocols?
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.
Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?
Dijkstra
Link-state protocols limit the scope of route change updates?
It is because it segments the network into area hierarchies
What two names refer to the same algorithm used by all link-state routing protocols?
Link-state routing algorithms, also known as shortest path first (SPF) algorithms.
What information is contained in LSPs sent by link-state protocols that is not included in distance vector routing protocol updates?
The state of directly connected links
Elementary data link protocols?
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.
