Dynamic Routing Protocol Concepts

Static routes work fine — until they don't. The moment your network has redundant paths, or the topology changes without you knowing, static routing becomes a full-time maintenance job. Dynamic routing protocols exist because humans make mistakes at 3 a.m., and networks need to heal themselves.

#The Case Against Static-Only#link

• ▪Every topology change requires manually updating every affected router
• ▪Redundant paths must be pre-computed and configured as floating statics
• ▪Convergence depends on the operator, not the network
• ▪Adding a new subnet means touching every router that needs to reach it
• ▪Human error scales linearly with network size — it's a bottleneck

None of that matters in a small network with two routers and one path. It all matters at five routers with redundancy, and it's a showstopper at fifty. Dynamic protocols solve the scale problem.

#Distance-Vector vs. Link-State#link

RIP is a pure distance-vector protocol — every 30 seconds it sends its entire routing table to neighbors, who update theirs and pass it along. It's the 'gossip protocol' of routing. OSPF is link-state — every router floods information about its own links, and every router builds an identical topology map, then runs Dijkstra to compute best paths.

#IGP vs. EGP#link

An Autonomous System (AS) is a group of networks under one administrative domain — usually one company or one ISP. Inside the AS, you run an IGP (OSPF, EIGRP, or IS-IS) — it's optimized for fast convergence and low overhead. Between ASes, you run BGP — it's optimized for policy, scalability, and handling hundreds of thousands of routes.

#Check Your Understanding#link