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

Distance Vector Routing: Connection Loss
From A: (A=0, B=inf, D=1, C=3, E=2)
over link L3
From B: (B=0, A=inf, D=2, C=1, D=1)
over link L2 and L4
From D: (D=0, A=1, B=2, E=1, C=2)
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 C to Link Costs
C Locally 0
B L2 1
A L5 3
E L5 1
D L5 2
The algorithm terminates, because A,
B, and C create and send new
vectors, but do not cause further
updates in the routing tables.
6.177