05_Network Layer_11

00:00 - CONTENT of this CHAPTER 00:11 - Routing Algorithms: Taxonomy 01:13 - Dynamic Routing can be Challenging … 01:49 - … and networks do not always work the way thex should! 03:21 - Fundamental Routing Algorithms 04:18 - Distance Vector Routing 06:27 - Distance Vector Routing 06:52 - Step 0: Initialization 07:18 - Step 1: Learn direct neighbors 08:48 - Step 2: Learn indirect neighbors 09:08 - Präsentation fortgesetzt 09:27 - Good News vs. Bad News 10:03 - Good News: New Router 10:22 - Good News: New Router 11:03 - Good News: New Router 11:24 - Good News: Link weight decreases 11:45 - „Good news travel fast!“ 12:33 - Bad News: Link weight increases 15:11 - Bad News: Router is down 15:22 - Bad News: Router is down 17:19 - Bad News: Router is down 17:44 - How to avoid loops? 19:02 - Bad News: Router is down 19:32 - How to avoid loops? 20:24 - Distance Vector Routing 22:12 - Link State Routing 24:05 - Link State Routing 25:08 - Link State Routing: Example 26:36 - Dijkstra Algorithm 27:25 - Dijkstra Algorithm: Outline 28:31 - Dijkstra Algorithm: Example (1) 29:02 - Dijkstra Algorithm: Example (2) 29:53 - Dijkstra Algorithm: Example (3) 30:46 - Dijkstra Algorithm: Example (4) 31:30 - Dijkstra Algorithm: Example (5) 32:19 - Dijkstra Algorithm: Example (6) 32:45 - Dijkstra Algorithm: Example (7) 33:06 - Dijkstra Algorithm: Example (8) 33:39 - Implementation of Dijkstra Algorithm (1) 33:47 - Implementation of Dijkstra Algorithm (2) 33:50 - Link State Routing 34:20 - Link-state vs. Distance Vector 34:57 - Questions & Tasks