Network Implementation

Static routes are manually configured by an administrator and never change on their own; dynamic routing protocols let routers learn and update routes automatically by exchanging information with neighbors.

On small or stub networks with one exit path — it adds no protocol overhead, is predictable, and is simple to secure because routers never exchange routing updates.

It does not adapt to topology changes — every failure or new subnet requires manual reconfiguration on each router, which does not scale.

Distance-vector protocols (e.g., RIP), which share their routing table with neighbors, and link-state protocols (e.g., OSPF), which build a full map of the topology.

A link-state interior gateway protocol (IGP) — each router floods link-state advertisements so every router builds an identical topology map and computes shortest paths with Dijkstra's algorithm.

Cost, which is derived from interface bandwidth — higher bandwidth links get lower cost, and the path with the lowest total cost wins.