Question of CCNA2 Chapter 10 (introducing to linkstate protocols)
Can someone Explain to me why there are no 4 correct answers?
To achieve network convergence, what three steps does each link state router take? (Choose three.)
use automatic summarization to reduce the size of routing tables
build a Link State Packet (LSP) containing the state of each directly connected link
flood the LSP to all neighbors, who then store all LSPs received in a database
discover neighbors and establish adjacencies using the hello packet sent at regular intervals
construct a complete map of the topology and compute the best path to each destination network
use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing table
chapter 11 says:
Before an OSPF router can flood its link-states to other routers, it must first determine if there are any other OSPF neighbors on any of its links. In the figure, the OSPF routers are sending Hello packets on all OSPF-enabled interfaces to determine if there are any neighbors on those links.
So for convergence HELLO-packets are necessairy?