lecture07: Intra-Domain Routing (Floyd-Warshall, and implementation)

This lecture continues the discussion of shortest-path routing. It provides a new algorithm (Floyd-Warshall) and so details of how shortest-path routing is implemented in the Internet.

Topics covered

• Floyd-Warshall
• Floyd-Warshall example
• Floyd-Warshall shortest paths
• Floyd-Warshall complexity
• Alternative algorithms
• Routing implementation
• SPF implementation
• SPF routing implementations
• OSPF
• Scaling of OSPF
• Load balancing
• Dijkstra and load balancing
• Dijkstra and load balancing ex.
• Load balancing implementation
• Link weights
• Incremental Dijkstra
• Generalization
• Link state vs Distance Vector
• Distance Vector
• Distance Vector example
• Sink trees
• Distance Vector
• Count to infinity
• RIP