11. Network Layer: Routing tables and Dijkstra’s shortest path algorithm
Channel: Stefan Valentin
Date: 04/08/2020

Recording of the lecture "Networks" in the summer term 2020. Slides in English, presented in German

Topics
Part 1
From spanning trees to routing tables
Computing routing tables: 30 minutes Dijkstra

Part 2
Hierarchical routing
Addressing
Case study: IP routing, forwarding, & addressing

Prof. Dr. Stefan Valentin, Department of Computer Science, Darmstadt University of Applied Sciences
https://fbi.h-da.de/en/people/stefan-valentin/

Links in this video:
* Good discussion of algorithm, pseudocode and C++ code:
https://www.boost.org/doc/libs/1_65_1/libs/graph/doc/dijkstra_shortest_paths.html
* Interesting implementation in Javascript via a priority queue:
https://github.com/felipernb/algorithms.js/blob/master/src/algorithms/graph/dijkstra.js
* Problem definition and (curated) links to other implementations:
http://algorist.com/problems/Shortest_Path.html