Networking Lecture 10 - Router Internals and Routing Algorithms

Outline:
0:06 Last lecture: NAT & IPv6
3:46 Routing Review
5:01 Input and output "ports" on routers
7:45 Simple router model
8:46 First generation routers
10:24 Modern router architecture
11:50 Input ports process packets in parallel
14:22 Switching fabric – connects input and output ports
17:28 Crossbar switch
19:57 Road analogy for switching fabrics
21:12 Output ports
24:53 Queues and packet loss
28:02 Weighted fair queuing (WFQ)
30:40 Next Topic: IP Control Plane
31:05 Centralized versus Distributed algorithms
34:02 Graph abstraction of computer networks
36:41 Shortest Path problem
38:17 Shortest path insight
41:03 Bellman-Ford equation
42:18 Bellman-Ford recursion
42:49 Bellman-Ford algorithm
46:10 Bellman-Ford demo
53:48 Dijkstra’s algorithm
1:06:07 Distance-Vector algorithm
1:08:28 DV is recalculated using Bellman-Ford equation
1:16:25 DV algorithm example
1:16:52 Recap