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

Distance Vector Routing: Example
From B: (B=0, A=1, D=1, C=1, E=1)
over link L1, L3, and L4.
From D: (D=0, A=1, B=2, E=1) over
link L3 and L6.
From E: (E=0, B=1, A=2, D=1, C=1)
over link L4, L5, and L6.
A
L 3
L 1
L 4
D E
L 6
B C
L 2
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
L 5
From D to Link Costs
D Locally 0
A L3 1
B L3 2
E L6 1
C L6 2
The algorithm terminates since
A, C, and D create and send new
vectors, but B, D, and E do not
have to apply updates any
longer.
6.169