Which characteristics are representative of a link-state routing protocol? (Choose three.)
A.
provides common view of entire topology
B.
exchanges routing tables with neighbors
C.
calculates shortest path
D.
utilizes event-triggered updates
E.
utilizes frequent periodic updates
Each of routers running link-state routing protocol learns paths to all the destinations in its “area” so we can say A is correct although it is a bit unclear.
Link-state routing protocols generate routing updates only (not the whole routing table) when a change occurs in the network topology so B is not correct.
Link-state routing protocol like OSPF uses Dijkstra algorithm to calculate the shortest path -> C is correct.
Unlike Distance vector routing protocol (which utilizes frequent periodic updates), link-state routing protocol utilizes event-triggered updates (only sends update when a change occurs) -> D is correct but E is not correct.
0
0