Chapter 9

🏃‍♂️ Dynamic Routing - Smart Mailmen

By Sys-Metrics· · 75 min chapter

🎯 Meet the Super-Intelligent Mail Network

If static routing is like giving manual directions to every postal worker, then dynamic routing is like hiring a team of super-smart mailmen who talk to each other, share information about the best routes, and automatically adapt when roads are blocked. These routing protocols are the GPS systems of the networking world!

🎯 Chapter Goals: Understand routing protocol fundamentals, master OSPF and EIGRP configuration, learn how protocols adapt to network changes, and build self-healing networks that work like magic!

🆚 Static vs Dynamic Routing: The Great Debate

Understanding when to use static vs dynamic routing is crucial for network design:

📝 Static Routing (Manual Directions)

  • Configuration: Admin manually enters every route
  • Updates: No automatic updates when topology changes
  • CPU Usage: Minimal processing overhead
  • Memory: Low memory requirements
  • Security: More secure (no protocol advertisements)
  • Best for: Small, stable networks

🏃‍♂️ Dynamic Routing (Smart Mailmen)

  • Configuration: Protocol automatically discovers routes
  • Updates: Automatic convergence on topology changes
  • CPU Usage: Higher processing for calculations
  • Memory: More memory for topology database
  • Security: Requires authentication configuration
  • Best for: Large, complex, changing networks

When to Use Each Method

Static Routing Wins

Hub-and-spoke networks, branch offices, connection to ISP, security-critical environments

Dynamic Routing Wins

Mesh networks, redundant paths, large networks, networks that change frequently

Hybrid Approach

Default routes to ISP (static) + internal routing protocol (dynamic)

Cost Consideration

Dynamic protocols use bandwidth for updates but save admin time

🧠 Memory Trick: Static = Simple but Stubborn, Dynamic = Smart but uses more System resources!

🏭 Routing Protocol Classifications

Routing protocols are like different types of mail services with their own strengths and weaknesses:

Distance Vector vs Link State

📏 Distance Vector (Rumor Mill)

  • Information: Direction and distance to destinations
  • Knowledge: Only knows what neighbors tell them
  • Updates: Periodic full routing table updates
  • Convergence: Slower to converge
  • Examples: RIP, older EIGRP behavior
  • Analogy: Asking directions from strangers

🗺️ Link State (Complete Map)

  • Information: Complete network topology
  • Knowledge: Full picture of entire network
  • Updates: Event-triggered topology changes
  • Convergence: Faster convergence
  • Examples: OSPF, IS-IS
  • Analogy: Having a GPS with full map

Interior vs Exterior Gateway Protocols

IGP (Interior Gateway Protocol)

Used within a single organization's network (OSPF, EIGRP, RIP)

EGP (Exterior Gateway Protocol)

Used between different organizations (BGP for internet routing)

Autonomous System

Collection of networks under single administrative control

CCNA Focus

We focus on IGPs since they're used in enterprise networks

Routing Protocol Comparison

RIP (Routing Information Protocol)
Distance Vector • AD 120
Max 15 hops • Legacy protocol
EIGRP (Enhanced Interior Gateway Routing Protocol)
Advanced Distance Vector • AD 90
Cisco proprietary • Fast convergence
OSPF (Open Shortest Path First)
Link State • AD 110
Open standard • Hierarchical design

🦅 OSPF: The Eagle with Perfect Vision

OSPF (Open Shortest Path First) is like an eagle that flies high above the landscape and sees the entire network topology. It builds a complete map and calculates the shortest path to every destination:

OSPF Key Concepts

Link State Database

Complete topology map shared by all routers in area

Shortest Path First

Uses Dijkstra algorithm to calculate best paths

Areas

Hierarchical design reduces routing overhead

Router ID

Unique identifier for each OSPF router

Hello Protocol

Discovers neighbors and maintains relationships

OSPF Area Design

0
Backbone Area (Area 0)
Central hub that connects all other areas
1
Regular Areas
Standard OSPF areas connected to backbone
S
Stub Areas
Areas with limited external routing information
N
NSSA Areas
Not-So-Stubby Areas with controlled external routes

OSPF Router Types

Internal Router
All interfaces in same area
Area Border Router (ABR)
Connects multiple areas
Autonomous System Border Router (ASBR)
Connects to external networks
Backbone Router
Has interface in Area 0

OSPF Configuration

Router(config)# router ospf 1
# Enter OSPF configuration mode (process ID 1)
Router(config-router)# router-id 1.1.1.1
# Set unique router ID manually
Router(config-router)# network 192.168.10.0 0.0.0.255 area 0
# Advertise 192.168.10.0/24 network in area 0
Router(config-router)# network 192.168.20.0 0.0.0.255 area 0
# Advertise 192.168.20.0/24 network in area 0
Router(config-router)# network 10.1.1.0 0.0.0.3 area 0
# Advertise point-to-point link in area 0
Router(config-router)# passive-interface fastethernet 0/0
# Don't send OSPF hellos on LAN interface

OSPF Verification Commands

Router# show ip ospf neighbor
Neighbor ID Pri State Dead Time Address Interface
2.2.2.2 1 FULL/BDR 00:00:38 10.1.1.2 Serial0/0/0
3.3.3.3 1 FULL/DR 00:00:35 192.168.100.3 FastEthernet0/1
Router# show ip ospf database
OSPF Router with ID (1.1.1.1) (Process ID 1)
Router Link States (Area 0)
Link ID ADV Router Age Seq# Checksum Link count
1.1.1.1 1.1.1.1 69 0x80000002 0x008B5E 3
2.2.2.2 2.2.2.2 70 0x80000002 0x001D43 2
3.3.3.3 3.3.3.3 71 0x80000002 0x00F229 2
Router# show ip ospf interface brief
Interface PID Area IP Address/Mask Cost State Nbrs F/C
Fa0/0 1 0 192.168.10.1/24 1 DR 0/0
Fa0/1 1 0 192.168.20.1/24 1 BDR 1/1
Se0/0/0 1 0 10.1.1.1/30 64 P2P 1/1

⚡ EIGRP: The Hybrid Champion

EIGRP (Enhanced Interior Gateway Routing Protocol) is like a supercharged postal service that combines the best features of distance vector and link state protocols. It's Cisco's proprietary protocol that's fast, efficient, and easy to configure:

EIGRP Key Features

DUAL Algorithm

Diffusing Update Algorithm guarantees loop-freedom

Composite Metric

Uses bandwidth, delay, reliability, load, and MTU

Triggered Updates

Only sends updates when topology changes

Unequal Cost Load Balancing

Can use multiple paths with different costs

Successor and Feasible Successor

Primary path and backup path calculations

EIGRP Terminology

S
Successor
Best path to destination (lowest FD)
FS
Feasible Successor
Backup path (AD < FD of successor)
FD
Feasible Distance
Total metric to destination via successor
AD
Advertised Distance
Neighbor's metric to destination

EIGRP Configuration

Router(config)# router eigrp 100
# Enter EIGRP configuration (AS number 100)
Router(config-router)# eigrp router-id 1.1.1.1
# Set EIGRP router ID manually
Router(config-router)# network 192.168.10.0 0.0.0.255
# Advertise 192.168.10.0/24 network
Router(config-router)# network 192.168.20.0
# Classful network advertisement
Router(config-router)# network 10.0.0.0
# Advertise entire Class A network
Router(config-router)# passive-interface fastethernet 0/0
# Prevent EIGRP hellos on LAN interface
Router(config-router)# no auto-summary
# Disable automatic route summarization

EIGRP Verification Commands

Router# show ip eigrp neighbors
IP-EIGRP neighbors for process 100
H Address Interface Hold Uptime SRTT RTO Q Seq
(sec) (ms) Cnt Num
0 10.1.1.2 Se0/0/0 13 00:05:24 40 240 0 3
1 192.168.100.3 Fa0/1 12 00:03:56 12 200 0 5
Router# show ip eigrp topology
IP-EIGRP Topology Table for AS(100)/ID(1.1.1.1)
P 192.168.10.0/24, 1 successors, FD is 28160
via Connected, FastEthernet0/0
P 192.168.20.0/24, 1 successors, FD is 28160
via Connected, FastEthernet0/1
P 192.168.30.0/24, 1 successors, FD is 2172416
via 10.1.1.2 (2172416/28160), Serial0/0/0
Router# show ip protocols
Routing Protocol is "eigrp 100"
Outgoing update filter list for all interfaces is not set
Incoming update filter list for all interfaces is not set
Default networks flagged in outgoing updates
Default networks accepted from incoming updates
EIGRP metric weight K1=1, K2=0, K3=1, K4=0, K5=0
EIGRP maximum hopcount 100
EIGRP maximum metric variance 1
Redistributing: eigrp 100
EIGRP NSF-aware route hold timer is 240s
Automatic network summarization is not in effect
Maximum path: 4
Routing for Networks:
10.0.0.0
192.168.10.0/24
192.168.20.0
Routing Information Sources:
Gateway Distance Last Update
10.1.1.2 90 00:03:24
Distance: internal 90 external 170

EIGRP Metric Calculation

EIGRP Metric Formula:
Metric = 256 * [(K1 * BW) + (K2 * BW)/(256 - Load) + (K3 * Delay)]
Default K values:
K1 = 1 (Bandwidth weight)
K2 = 0 (Load weight - disabled)
K3 = 1 (Delay weight)
K4 = 0 (Reliability weight - disabled)
K5 = 0 (MTU weight - disabled)
Simplified formula with defaults:
Metric = 256 * (BW + Delay)
Where BW = 10^7 / slowest_bandwidth_kbps
And Delay = sum_of_delays_microseconds / 10

🔄 Convergence and Network Changes

The real magic of dynamic routing happens when networks change. Let's see how these smart protocols adapt:

OSPF Convergence Process

Scenario: Link between Router A and Router B fails
💔
Router A detects link failure (no hello packets received)
🚨
Router A floods LSA (Link State Advertisement) about topology change
📢
All routers in area receive and forward LSA throughout network
🧮
Each router runs SPF algorithm to calculate new shortest paths
🔄
Routing tables updated with new best paths avoiding failed link
✅
Network converged! Traffic flows via alternate paths

EIGRP Convergence Process

Scenario: Primary path fails but feasible successor exists
💔
Router detects failure of successor route
🔍
Router checks topology table for feasible successor
⚡
Feasible successor immediately promoted to successor (instant convergence!)
📤
Router notifies neighbors of route change
✅
Network converged in milliseconds without queries

Convergence Comparison

EIGRP with FS
Milliseconds (instant)
EIGRP without FS
Seconds (queries needed)
OSPF
Seconds (SPF calculation)
RIP
Minutes (count to infinity)

EIGRP DUAL States

Passive State

Normal operation - route is stable and in routing table

Active State

Route lost, no feasible successor - router sends queries

Stuck in Active (SIA)

Router doesn't receive query replies - neighbor relationship reset

Query Range

Queries can propagate through entire EIGRP domain

⚖️ OSPF vs EIGRP: The Ultimate Comparison

🦅 OSPF Advantages

  • Open Standard: Works with all vendors
  • Hierarchical Design: Areas reduce overhead
  • No Vendor Lock-in: Industry standard protocol
  • Detailed Database: Complete topology visibility
  • Well Documented: Extensive RFC specifications
  • Predictable Convergence: Consistent SPF behavior

⚡ EIGRP Advantages

  • Easy Configuration: Minimal commands needed
  • Fast Convergence: Instant with feasible successors
  • Bandwidth Efficient: Bounded updates only
  • Flexible Metrics: Multiple path criteria
  • Unequal Load Balancing: Traffic optimization
  • Loop Prevention: DUAL algorithm guarantees

Configuration Complexity Comparison

EIGRP Configuration (Simple)
Router(config)# router eigrp 100
Router(config-router)# network 192.168.0.0
Router(config-router)# no auto-summary

OSPF Configuration (More Complex)
Router(config)# router ospf 1
Router(config-router)# router-id 1.1.1.1
Router(config-router)# network 192.168.10.0 0.0.0.255 area 0
Router(config-router)# network 192.168.20.0 0.0.0.255 area 0
Router(config-router)# passive-interface default
Router(config-router)# no passive-interface serial 0/0/0

When to Choose Which Protocol

Choose OSPF When

Multi-vendor environment, large hierarchical network, industry standard required

Choose EIGRP When

All-Cisco environment, fast convergence critical, simple configuration preferred

Consider RIP When

Very small network, legacy equipment, or learning purposes only

Real World

Many networks use OSPF as primary with EIGRP for specific high-performance areas

🛠️ Hands-On Dynamic Routing Labs

Lab 1: Basic OSPF Configuration

  1. Topology Setup:
    • Create 3 routers in triangle topology
    • Add loopback interfaces for testing
    • Use different subnets for all links
    • Document IP addressing scheme
  2. OSPF Configuration:
    • Configure OSPF process 1 on all routers
    • Set unique router IDs (1.1.1.1, 2.2.2.2, 3.3.3.3)
    • Advertise all networks in area 0
    • Use passive-interface for LAN segments
  3. Verification:
    • Check neighbor adjacencies
    • Verify routing table population
    • Test end-to-end connectivity
    • Analyze OSPF database

Lab 2: EIGRP Configuration and Tuning

  1. Initial Setup:
    • Use same topology from OSPF lab
    • Remove OSPF configuration
    • Configure EIGRP AS 100
    • Set router IDs and disable auto-summary
  2. Advanced Configuration:
    • Configure unequal cost load balancing
    • Adjust interface bandwidth and delay
    • Set up EIGRP authentication
    • Create route summaries
  3. Testing Convergence:
    • Break primary link and measure convergence time
    • Verify feasible successor operation
    • Monitor EIGRP topology table changes
    • Test load balancing across multiple paths

Lab 3: Protocol Redistribution

  1. Mixed Environment:
    • Configure OSPF in one area
    • Configure EIGRP in another area
    • Connect areas with redistribution router
    • Add static routes to simulate external networks
  2. Redistribution Setup:
    • Redistribute OSPF routes into EIGRP
    • Redistribute EIGRP routes into OSPF
    • Control route distribution with route maps
    • Set administrative distances appropriately
  3. Optimization:
    • Configure route summarization
    • Filter unnecessary routes
    • Verify routing table efficiency
    • Test failover between protocols

Lab 4: Troubleshooting Dynamic Routing

  1. Create Problems:
    • Mismatched OSPF area assignments
    • Wrong EIGRP AS numbers
    • Incorrect wildcard masks
    • Network statement errors
    • Authentication mismatches
  2. Troubleshooting Practice:
    • Use systematic approach
    • Check neighbor relationships first
    • Verify network advertisements
    • Analyze protocol databases
    • Test connectivity methodically
🎯 Master Challenge: Build a complex network with OSPF backbone, EIGRP stub sites, and static routes to internet. Include redundant paths and test all failure scenarios!

🚨 Dynamic Routing Troubleshooting

OSPF Common Issues

Problem: OSPF neighbors stuck in Init state
Routers see each other but can't form full adjacency
Check These:
✓ Area mismatch (both routers must be in same area)
✓ Subnet mask mismatch on connected interfaces
✓ Hello/Dead timer mismatch
✓ Authentication configuration differences
✓ Access lists blocking OSPF multicast (224.0.0.5/6)
Problem: OSPF routes not appearing
Neighbors are up but routes missing from table
Investigate:
✓ Network statements include all interfaces
✓ Areas are properly connected to backbone
✓ No routing loops causing SPF issues
✓ Router has sufficient memory for LSA database

EIGRP Common Issues

Problem: EIGRP neighbors not forming
Routers can't establish EIGRP adjacency
Check These:
✓ AS number mismatch (must be identical)
✓ K values mismatch (metric calculation weights)
✓ Authentication key differences
✓ Interface is not passive
✓ Network statements cover interface IP
Problem: EIGRP stuck in active (SIA)
Routes go active but never converge
Solutions:
✓ Implement route summarization to limit query scope
✓ Use EIGRP stub areas at remote sites
✓ Check for slow WAN links delaying responses
✓ Verify proper network design (avoid too many hops)

General Dynamic Routing Troubleshooting

Step 1: Check routing protocol process
show ip protocols

Step 2: Verify neighbor relationships
show ip ospf neighbor
show ip eigrp neighbors

Step 3: Examine routing table
show ip route [protocol]

Step 4: Check interface participation
show ip ospf interface
show ip eigrp interfaces

Step 5: Analyze protocol database
show ip ospf database
show ip eigrp topology

Performance Optimization

OSPF Optimization

Tune hello/dead timers, use area summarization, configure LSA filtering

EIGRP Optimization

Adjust bandwidth and delay, implement summarization, use stub configurations

Memory Management

Monitor router memory usage, implement route filtering, use default routes

Bandwidth Control

Limit routing updates on WAN links, use summarization, schedule updates

🎯 Advanced Dynamic Routing Concepts

Route Summarization

Summarization reduces routing table size and update overhead by advertising aggregate routes:

OSPF Area Summarization (ABR)
Router(config-router)# area 1 range 192.168.0.0 255.255.248.0
# Summarize area 1 networks into single advertisement

EIGRP Interface Summarization
Router(config-if)# ip summary-address eigrp 100 192.168.0.0 255.255.248.0
# Summarize routes advertised out this interface

Load Balancing

Equal Cost Load Balancing

Both OSPF and EIGRP support up to 4 equal cost paths by default

EIGRP Unequal Cost

EIGRP can load balance across paths with different metrics using variance

Traffic Distribution

Per-destination (default) or per-packet load balancing options

Router(config-router)# maximum-paths 6
# Allow up to 6 equal cost paths
Router(config-router)# variance 2
# EIGRP: use paths up to 2x the best metric

Authentication

Secure routing protocols from unauthorized routers joining:

OSPF Authentication
Router(config-if)# ip ospf message-digest-key 1 md5 MySecretKey
Router(config-if)# ip ospf authentication message-digest

EIGRP Authentication
Router(config-if)# ip authentication mode eigrp 100 md5
Router(config-if)# ip authentication key-chain eigrp 100 MyKeyChain

📖 Chapter Summary

  • Dynamic Routing Benefits: Automatic route discovery, convergence on failures, scalability for large networks
  • OSPF: Link state protocol with hierarchical areas, open standard, complex but powerful
  • EIGRP: Cisco proprietary hybrid protocol, fast convergence, simple configuration
  • Convergence: EIGRP fastest with feasible successors, OSPF requires SPF recalculation
  • Route Selection: Administrative distance first, then metric comparison
  • Areas and AS: OSPF uses areas for hierarchy, EIGRP uses autonomous system numbers
  • Troubleshooting: Check neighbors first, then routing tables and protocol databases
  • Optimization: Use summarization, authentication, and load balancing for efficiency
🎯 Dynamic Routing Mastery! You've learned how to build self-healing networks that automatically adapt to changes. These smart protocols are the foundation of modern enterprise networks!

📝 Dynamic Routing Mastery Quiz

1. What's the main advantage of dynamic routing over static routing? Automatic adaptation to network changes, reduced administrative overhead, and built-in redundancy with convergence capabilities

2. How does OSPF build its routing table? Creates link state database with complete topology, runs SPF algorithm to calculate shortest paths to all destinations

3. What makes EIGRP convergence so fast? DUAL algorithm maintains feasible successors as backup paths, allowing instant convergence without queries when primary path fails

4. What's the difference between administrative distance and metric? Administrative distance determines trustworthiness between routing sources; metric determines best path within the same routing protocol

5. Why use OSPF areas? Areas contain flooding of LSAs, reduce routing overhead, enable hierarchical design, and improve network scalability

6. What happens when EIGRP goes "stuck in active"? Route becomes unreachable because router sent queries but didn't receive all replies within timeout period, causing neighbor reset

7. When would you choose EIGRP over OSPF? All-Cisco environment needing fast convergence, simple configuration requirements, or unequal cost load balancing

8. How do you prevent routing loops in dynamic protocols? OSPF uses SPF algorithm, EIGRP uses DUAL algorithm, both maintain loop-free topology through mathematical guarantees

Comments