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

Distance Vector Routing
● The Distance Vector Routing
● Every router manages a table with (known/estimated) distances to each
destination and the assigned lines to neighbor nodes
● Each router is assumed to know the distances to its neighbors
● Regularly, the distance information of the routing tables is communicated to the
neighbors
● Based on the information from the neighbors and the known distances to the
neighbors every router re-computes its routing table
● Without the use of the own old routing information
● Example of a Distance Vector: DV j = [(A=2), (B=3), (C=1), …]
● A is reachable with costs 2
● B is reachable with costs 3
● C is reachable with costs 1
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
6.158