lecture06: Routing: Intra-Domain (as a kind of optimization, Dijkstra)

This lecture introduces the routing problem, and describes a common approach to its solution (Dijkstra's algorithm) for shortest-path routing.

Topics covered

• Logical vs Physical Network
• Mapping the logical to the physical
• Circuit switching won't go away
• Routing
• Notation and Assumptions
• Network Paths
• Notation and Assumptions
• Routing
• Routing costs
• Routing problem
• Linear costs
• Path lengths
• Network path-length example
• Linear costs => shortest path routing
• Special case
• Triangle inequality
• Dijkstra's algorithm
• Dijkstra Example
• Dijkstra Result
• Dijkstra intuition
• Dijkstra issues
• Dijkstra complexity
• Sketch of proof of Dijkstra