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

Distance Vector Routing: Example
B now transfers its vector (B=0, A=1)
using link L1, L2, and L4 to its
neighbors A, C, and E.
A receives this vector over link L1 and
updates its table as follows:
A=2 is larger than A=0 � discard
B=1 for link L1
Similar to this, the vector of D is
processed.
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
A
L 3
L 1
L 4
D E
L 6
B C
L 2
Routing table of A after updating
with information coming from D
and B
From A to Link Costs
A Locally 0
B L1 1
D L3 1
L 5
6.163