Networking Lecture 11 - BGP Routing

Outline:
0:18 Last Lecture: Router internals & Routing algorithms
3:29 What's in a Distance Vector?
7:14 Distance Vector (DV) calculation
10:13 What happens when link costs change?
13:17 Bad news travels slowly
14:21 Count to Infinity Demo
28:48 Count to Infinity solutions
32:19 Centralized (LS)
35:09 Hierarchical routing
38:07 Autonomous System (AS)
40:08 List of BGP autonomous systems is here:
41:11 Interior Gateway Protocols (Intra-AS routing)
42:27 OSPF highlights
43:44 Border Gateway Protocol (Inter-AS routing)
45:03 DV vs. BGP advertisement
48:22 BGP Basics
49:37 BGP Advertisements (DVs in practice)
51:00 AS_PATH
52:18 BGP Route Selection in practice
55:55 Combining Intra- and Inter-AS decisions
57:24 Summary: Why different Intra-, Inter-AS routing?
59:37 Intermission
59:52 An extended BGP example
1:02:07 Basic shortest-hop
1:04:52 Intra-AS routing
1:06:57 Forwarding tables
1:09:53 Aggregating routes
1:10:40 Prefix aggregation detail
1:11:50 Prefix aggregation detail (2)
1:13:58 BGP step-by-step
1:16:37 After hearing from neighbors
1:18:31 BGP advertisement from AS1
1:19:44 AS0 recalculates its routes
1:21:44 Next, AS0 hears from AS2 & updates
1:23:31 Why not use transitive routes?
1:27:13 Choosing among alternative routes
1:29:03 Local preference
1:30:32 Types of Autonomous Systems
1:34:05 Multihoming
1:34:36 BGP routing review