Dynamic Routing

Routing in which protocols automatically learn and update routes as the network changes.

Dynamic routing protocols let routers automatically discover neighbors, exchange reachability information, and recalculate best paths whenever the topology changes. Examples on N10-009 include OSPF (a link-state protocol that builds a full topology map) and BGP (used between autonomous systems on the internet). Unlike static routing, it adapts to link failures without administrator intervention, making it the standard choice for larger networks. The key exam contrast is convergence: link-state protocols like OSPF reconverge faster than older distance-vector protocols, which propagate changes hop by hop. Pair “self-healing” or “automatic failover” with a dynamic protocol, not a static route.

PlayPrepHQ study notes are written and reviewed against primary exam sources. How we create & review content →

Related terms

Back to Network Implementation