8. Link State Routing

Question 1

What is the primary advantage of Link State Routing over Distance Vector
Routing?

Answer 1

Link State Routing converges faster and provides more accurate routing
decisions by maintaining a complete topology of the network.

Question 2

How does Dijkstra’s Algorithm work in Link State Routing?

Answer 2

It calculates the shortest path from a router to all other nodes by building a
topology map and iteratively determining the lowest-cost path.

Question 3

What is a Link State Advertisement (LSA)?

Answer 3

An LSA is a packet containing information about a router’s neighbors and
link costs, shared with other routers in the network.

Question 4

What is the role of OSPF in Link State Routing?

Answer 4

OSPF (Open Shortest Path First) is a protocol that uses Link State Routing to
efficiently manage and distribute routing information within and across areas.

Question 5

Why is OSPF hierarchical, and how does it improve scalability?

Answer 5

OSPF uses areas to limit the scope of LSAs, reducing the amount of routing
information exchanged and improving scalability in large networks.

Question 6

What is the function of OSPF’s Hello packets?

Answer 6

Hello packets are used to discover and establish adjacency with neighboring
routers.