(CCNA 200-301)
Dynamic Routing – CCNA Notes
What is Dynamic Routing?
● Dynamic Routing allows routers to automatically learn and maintain routing tables using
routing protocols.
● Routers exchange routing information with other routers.
● It adapts to changes in the network topology.
Advantages:
● Self-updating
● Automatically finds best path
● Supports scalability and redundancy
IGP vs EGP
Feature IGP (Interior Gateway EGP (Exterior Gateway
Protocol) Protocol)
Definition Routing within a single AS Routing between different
(Autonomous System) ASes
Scope Internal networks Global Internet routing
Examples RIP, OSPF, EIGRP, IS-IS BGP
Use Case Inside enterprises or ISPs Between ISPs or large
organizations
Administrative Authority Controlled by one Controlled by multiple
organization organizations (global)
1
Autonomous System (AS)
● An Autonomous System (AS) is a group of IP networks under a single administrative
control.
● Each AS is identified by an AS number (ASN):
○ Public ASN: 1–64511
○ Private ASN: 64512–65534
In Routing:
● IGPs work within an AS.
● EGP (e.g., BGP) works between ASes to exchange routing information.
Metric – What Is It?
● A metric is a value used by routing protocols to determine the best path to a destination.
● Lower metric = better path.
Routing Protocol Metric Used
RIP Hop Count (Max 15)
EIGRP Bandwidth + Delay
OSPF Cost (based on bandwidth)
BGP Path Attributes
Administrative Distance (AD)
● Administrative Distance is the trustworthiness of a route source.
● Lower AD = more preferred.
2
Route Source AD Value
Connected Interface 0
Static Route 1
EIGRP (internal) 90
OSPF 110
RIP 120
EIGRP (external) 170
BGP (external) 20
BGP (internal) 200
unreachable 255
● 📝 Example: If a router learns the same destination via RIP (AD 120) and OSPF (AD 110), it
chooses OSPF.
Distance Vector vs Link-State Routing
Feature Distance Vector Link-State
How it works Shares full routing table with Shares topology map with all
neighbors routers
Knowledge of Network Knows only neighbors Knows entire network
topology
Update Interval Periodic updates Triggered updates
Bandwidth Usage Higher (due to frequent full Lower (only sends changes)
updates)
3
Convergence Time Slower Faster
Protocols RIP, IGRP OSPF, IS-IS
Loop Prevention Uses methods like Split Uses Dijkstra SPF algorithm
Horizon, Poison Reverse
Analogy:
● Distance Vector = "Tell me what you know"
● Link-State = "Tell me everything you see"
Key Protocols and Their Category
Protocol Type Algorithm Metric Used AD Value Notes
RIP Distance Bellman-Ford Hop count 120 Max 15 hops
Vector
EIGRP Advanced DV DUAL Bandwidth + 90 Cisco
(Hybrid) Delay proprietary
OSPF Link-State Dijkstra (SPF) Cost 110 Open
(bandwidth) standard
BGP Path Vector N/A Path 20 Used for
attributes Internet
routing
Tips for Remembering:
● AD Lowest Wins
➤ 0 = Best (Connected), 120 = RIP (less preferred)
● Metric = Path Cost
➤ Each protocol has its own way of calculating the best path.
4
● Distance Vector → Neighbors only
Link-State → Full network view