Professional Documents
Culture Documents
03
CS 5220:
COMPUTER COMMUNICATIONS
Sa e 392
nJ Jos
os
e San
29
4
Sa
n
Jo
San Jose 596 se
25
0
Distance Vector Table Synthesis
Neighbors exchange
table entries
Determine current best
Local Signpost
Direction next hop
Inform neighbors
Distance
Periodically
After changes
Routing Table
For each destination list: dest next dist
Next Node
Distance
Shortest Path to SJ
Focus on how nodes find their shortest
path to a given destination node, i.e. SJ San
Jose
Dj
Cij j
i
If Di is the shortest distance to SJ from i
Di and if j is a neighbor on the shortest path,
then Di = Cij + Dj
But we don’t know the shortest paths
Router i only has local info
from neighbors
San
Dj' Jose
j'
Cij'
Dj
Cij j
i
Di Cij” Pick current
j" Dj" shortest path
How Distance Vector Works
San
3 Hops
2 Hops
1 Hop
From SJ Jose
From SJ
From SJ
How Distance Vector Works SJ sends
accurate info
San
3 Hops
2 Hops
1 Hop
From SJ Jose
From SJ
From SJ
How Distance Vector Works
San
3 Hops
2 Hops
1 Hop
From SJ Jose
From SJ
From SJ
Hop-1 nodes
calculate current
(next hop, dist), &
send to neighbors
San
3 Hops
2 Hops
1 Hop
From SJ Jose
From SJ
From SJ
D3=D6+1
n3=6
D6=0
2 3 1
1 1
5 2
0
3
4 San
1 3 6
Jose
2 4 5 2
2
D5=D6+2 D6=0
n5=6
Iteration Node 1 Node 2 Node 3 Node 4 Node 5
3 2 1
3
1 1
5 2
3 0
3
4 San
1 3 6
Jose
2 4 2
5
6 2
Iteration Node 1 Node 2 Node 3 Node 4 Node 5
3 2
1
3
1 1
5 2
3 0
3
4 San
1 3 6
Jose
2
2 5
4
64 2
Summary: Shortest-Path
Tree
3 2
1
3
1 1
5 2
3 0
4 San
1 3 6
Jose
2
2 5
6 2