##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
RIP, OSPF, and EIGRP
Why dynamic routing
Core concept
Route source preference
Two protocol families
Routing by rumor
Complete topology view
Simple distance vector
v1 vs v2 comparison
Update and failure detection
Handling count to infinity
When RIP fails
Test your knowledge
Link state protocol
Hierarchical design
Roles in hierarchy
Hello protocol
Forming adjacencies
Reducing adjacencies
Choosing the DR
Path metric
Link state advertisements
Stub and NSSA
Test your knowledge
Advanced distance vector
Composite calculation
Diffusing Update Algorithm
Primary and backup paths
Hello packets
Protocol messages
Query problem
Reducing table size
Test your knowledge
Protocol selection
Failover speeds
Network size limits
Connecting protocols
Common problems
Summary of concepts
