Static Routing vs Dynamic Routing

Static routing uses routes that are manually configured by a network administrator and do not change unless edited by hand. Dynamic routing uses routing protocols that automatically discover routes and update the routing table whenever the topology changes.

Parameter	Static Routing	Dynamic Routing
Configuration	Entries entered manually by the administrator	Learned automatically via routing protocols (RIP, OSPF, EIGRP, BGP)
Route updates	No automatic update; change only by manual edit	Continuous/triggered periodic updates; table rebuilt as topology changes
Adaptability to failure	Cannot adapt — traffic must be manually re-routed after a link failure	Automatically detects failures and recomputes alternate paths
Topology changes	Needs human intervention	Self-adjusting, converges to new state
Implementation complexity	Simple to configure for small/stable networks	Complex — requires protocol tuning, metric/area design, troubleshooting
Overhead / resources	No bandwidth or CPU overhead for protocols	Consumes CPU and link bandwidth for hellos, LSAs, updates
Scalability	Poor — one entry per destination, unmanageable in large networks	Excellent — scales with summarisation, areas, hierarchical design
Security	More secure (no routing advertisements exchanged)	Vulnerable to rogue updates unless authenticated (OSPF MD5, etc.)
Convergence	Immediate (static), but only if correct	Depends on protocol — fast for link-state, slower for distance-vector
Suitability	Small, stub/leaf networks, default routes, lab setups, cost-sensitive links	Large, complex, multi-path, frequently changing networks
Loop possibility	None (single fixed path)	Possible during convergence; controlled by split horizon, holddown, SPF
Metric used	None — preference is administrative	Cost, bandwidth, delay, hop count, load, reliability

Key discussion points

• Static is deterministic: the administrator fully controls the path, which is useful for security-sensitive or backup routes (e.g., a default route to an ISP), but it is labour-intensive and fails silently on link failure.
• Dynamic protocols exchange reachability information: distance-vector (RIP) shares neighbour distance vectors with count-to-infinity issues, while link-state (OSPF) floods the whole topology and each router runs Dijkstra independently, converging quickly and loop-free.
• Hybrid designs are common: dynamic routing inside the enterprise with static/default routes at the edge, and static redistribution where appropriate.

Conclusion: Static routing trades flexibility for simplicity/low overhead and suits small stable networks; dynamic routing trades protocol overhead and complexity for automatic adaptation and scalability — essential for large, changing networks.