Computer Networks · TEE · read-chapter

Distance vector, RIP, link state and OSPF

TEE · shared foundations and Units 3–4 · current syllabus 702AI0C023

  1. Distance-vector routing: learn costs through neighbours
  2. Distance-vector update · example 1
  3. Distance-vector update · example 2
  4. Distance-vector update · example 3
  5. RIP: hop counts, updates and the value 16
  6. Count-to-infinity and loop-mitigation methods
  7. Link-state routing: share a map, calculate locally
  8. OSPF: link-state shortest paths within an autonomous system
  9. The five OSPF packet types
  10. RIP versus OSPF; Bellman–Ford versus Dijkstra