Distance Vector: Step by Step
Uploaded by
Md Saidur Rahman KohinoorDistance Vector: Step by Step
Uploaded by
Md Saidur Rahman KohinoorDistance-vector Algorithms
CSE 313: Computer Networks
SR Kohinoor
[email protected]
Distance vector:
Each node sends list of its shortest distance to reach
each of its directly connected neighbors.
Algorithm:
Bellman-Ford algorithm
Distributed route computation using only neighbors
information.
Iterative, asynchronous:
each local iteration caused by:
Local link cost change
Distance vector update message from neighbor
Distributed:
Each node notifies neighbors only when its DV changes
Neighbors then notify their neighbors if necessary.
Bellman-Ford Algorithm:
Define distances at each node X
dx(y) = cost of least-cost path from X to Y
Update distances based on neighbors
dx(y) = min {c(x,v) + dv(y)} over all neighbors V
1 x
3
U
5
w4
3
s
du(z) = min{c(u,v) + dv(z), c(u,w) + dw(z)}
Step-by-Step:
c(x,v) = cost for direct link from x to v
Node x maintains costs of direct links c(x,v)
Dx(y) = estimate of least cost from x to y
Node x maintains distance vector Dx = [Dx(y): y N ]
Node x maintains its neighbors distance vectors
For each neighbor v, x maintains Dv = [Dv(y): y N ]
Each node v periodically sends Dv to its neighbors
And neighbors update their own distance vectors
Dx(y) minv{c(x,v) + Dv(y)} for each node y N
Example: Initial State
Info at
node A
7
A
Distance to Node
D
E
1
8
18
D sends vector to E
Im 2 from C, 0 from
D and 2 from E
Distance to Node
Info at
C
D
E
node A B
7
A
1
E
D is 2 away, 2+2< ,
so best path to C is 4
D
E
1
8
19
B sends vector to A
Im 7 from A, 0
from B, 1 from C
& 8 from E
Distance to Node
Info at
C
D
E
node A B
7
A
1
E
B is 7 away, 1+7< so
best path to C is 8
D
E
20
E sends vector to A
E is 1 away, 4+1<8
so C is 5 away, 1+2<
so D is 3 away
Info at
node A
1
E
Distance to Node
B
0
2
2
0
C
D
E
Im 1 from A, 8 from B, 4
from C, 2 from D & 0 from E
21
until Convergence
Distance to Node
Info at
C
D
E
node A B
7
A
1
E
0
22
Node Bs distance vectors
Next hop
B
7
A
1
E
Dest
12
12
10
10
23
Handling Link Failure
A marks distance to E as , and tells B
E marks distance to A as , and tells B and D
B and D recompute routes and tell C, E and E
etc until converge
7
A
Info
Distance to Node
at
node A B
C
D
E
0
7
8
10 12
A
B
10
12
THANK YOU
