Dynamic Routing Protocols – Complete Overview
Dynamic routing protocols allow routers to automatically learn and exchange routes, adapting to
network topology changes. They are grouped into Distance Vector, Link State, Hybrid, and Path
Vector categories.
1. Categories of Dynamic Routing Protocols
Category Description Examples
Distance Vector Routers share their routing tables with neighbors. RIP, IGRP
Link State Routers exchange link-state info to build a full topology. OSPF, IS-IS
Hybrid Combines features of DV and LS. EIGRP
Path Vector Used for inter-domain routing; exchanges AS paths. BGP
2. Major Dynamic Routing Protocols
RIP (Routing Information Protocol)
Type: Distance Vector
Algorithm: Bellman-Ford
Metric: Hop count (max 15)
Updates: Every 30s
Advantages: Simple
Drawbacks: Slow, limited hops
IGRP (Interior Gateway Routing Protocol)
Type: Distance Vector (Cisco proprietary)
Metric: Bandwidth, delay, reliability, load
Replaced by EIGRP
EIGRP (Enhanced Interior Gateway Routing Protocol)
Type: Hybrid
Algorithm: DUAL
Metric: Bandwidth + Delay
Updates: Partial
Fast convergence, Cisco-based
OSPF (Open Shortest Path First)
Type: Link State
Algorithm: Dijkstra
Metric: Cost (bandwidth-based)
Supports areas, authentication
Fast, open standard
IS-IS (Intermediate System to Intermediate System)
Type: Link State
Algorithm: Dijkstra
Metric: Cost
Used by ISPs, scalable
BGP (Border Gateway Protocol)
Type: Path Vector
Algorithm: Path Selection
Metric: AS Path, Local Pref
Transport: TCP 179
Used for Internet routing
3. Comparison Summary
Protocol Type Algorithm Metric Convergence Use
RIP Distance Vector Bellman-Ford Hop count Slow Small LANs
EIGRP Hybrid DUAL Composite Fast Cisco networks
OSPF Link State Dijkstra Cost Fast Enterprise
IS-IS Link State Dijkstra Cost Fast Service providers
BGP Path Vector Policy-based AS Path Slow Internet
Conclusion: OSPF and EIGRP dominate enterprise networks for fast convergence and scalability,
while BGP manages global Internet routing.