Week 9: Routing (Part 1)
Link state algorithm (Dijkstra's algorithm) and Distance-Vector algorithm
- Lecture notes:
- Routing - Lecture slides (6 per page)
- Terms with which you should be familiar:
- Routing algorithm, graph, node, edge, neighbor, cost, path, least-cost path, shortest path, global vs. decentralized routing algorithms, static vs. dynamic routing algorithms, link-state algorithms, Dijkstra's algorithm, link-state algorithms, congestion-based routing, route oscillations, Distance-vector algorithm, Bellman-Ford equation, routing loop, poisoned reverse.
