Which two statements are true about link-state routing protocols? (Choose two.)

Which two statements are true about link-state routing protocols? (Choose two.)
A . The advertisement exchange is mainly triggered by a change in the network.
B . Each router uses a reliable update mechanism to exchange topology information with its neighbors.
C . Link-state routing protocols mainly use hop-counts to determine the link cost
D . A distance vector algorithm is very processor intensive compared to Dijkstra’s algorithm.

View Answer

Answer: A, B

Explanation:

Link-state routing protocols are one of the two main classes of routing protocols used in packet switching networks for computer communications, the other being distance-vector routing protocols. Examples of link-state routing protocols include Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS). The basic concept of link-state routing is that every node constructs a map of the connectivity to the network, in the form of a graph, showing which nodes are connected to which other nodes. Each node then independently calculates the next best logical path from it to every possible destination in the network. Each collection of best paths will then form each node’s routing table.

Two statements that are true about link-state routing protocols are:

The advertisement exchange is mainly triggered by a change in the network. Link-state routing protocols use a flooding mechanism to distribute information about the network topology to all routers in the same area or domain. This information is encapsulated in link-state packets (LSPs) or link-state advertisements (LSAs), which contain information about the router, its directly connected links, and the state of those links. LSPs or LSAs are sent only when there is a change in the topology, such as a link failure or recovery, or when a periodic refresh timer expires. This way, link-state routing protocols can quickly adapt to network changes and maintain an accurate and consistent view of the network.

Each router uses a reliable update mechanism to exchange topology information with its neighbors. Link-state routing protocols use a reliable update mechanism to ensure that all routers receive and acknowledge the LSPs or LSAs sent by their neighbors. This mechanism involves sending hello messages to establish and maintain adjacencies with neighbors, sending acknowledgment messages to confirm the receipt of LSPs or LSAs, and requesting missing or outdated LSPs or LSAs from neighbors. This mechanism ensures that all routers have a synchronized database of LSPs or LSAs, which is used to build a complete network connectivity map and to calculate the shortest path to destinations.

Reference: Link-state routing protocol – Wikipedia, Ericsson IP Networking – Routing Protocols