What routing algorithm does OSPF primarily use?

• A. It Relies On Distance-Vector Routing
• B. It Uses A Link-State Routing Algorithm
• C. It Uses Path-Vector Routing
• D. It Uses Hop-By-Hop Updates

Answer: (B)

OSPF uses a link-state routing approach. In this method, every router learns the complete network topology by exchanging link-state information (LSAs) with all other routers in the area, building a shared map called the Link-State Database. Each router then runs the Shortest Path First algorithm (based on Dijkstra’s algorithm) to compute the best path from itself to every destination, selecting the next hop accordingly. This yields fast convergence and scalable, loop-free routes, especially when the network is divided into areas.

The other options describe different routing philosophies not used by OSPF: distance-vector relies on routers advertising only their distance to destinations to neighbors; path-vector is characteristic of protocols like BGP and uses path attributes rather than a full topology; hop-by-hop updates describe a simple forwarding approach rather than maintaining a complete topology for SPF calculations.