Module
Routing Algorithms and Intra-/Inter-domain Routing
Sign in to add this module to your path and practice.
About
Link-state (Dijkstra) and distance-vector (Bellman-Ford) algorithms, OSPF/RIP concepts, hierarchical routing, and BGP path-vector inter-domain routing and policy.
Goal
Compute shortest paths with Dijkstra and distance-vector; explain count-to-infinity and solutions; describe BGP route selection and AS relationships at a conceptual level.
Prerequisites
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Routing Algorithms and Intra-/Inter-domain Routing. Ask about the concepts, goal, or where you're stuck.