Telematics Chapter 6: Network Layer - Freie Universität Berlin

Routing: Shortest Path
● Static variant
● Router administrates a table with distances to each destination and lines to be
used
● Based on a constant metric
● Distance, line costs, transmission capacity, etc.
● Computation of the shortest path (regarding the metric)
● According to Dijkstra’s algorithm
● Adaptive variant
● Dynamic routing algorithms
● Dynamic metrics (e.g. current delay, actual transmission capacity)
● (Regular) update of the routing tables
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
6.143