Distance Vector Algorithm:

1 Initialization:

2 for all adjacent nodes v:

3 D (*,v) = infty /* the * operator means "for all rows" */

4 D (v,v) = c(X,v)

5 for all destinations, y

6 send min D (y,w) to each neighbor /* w over all X's neighbors */

X

X

X

w

At all nodes, X:

Previous slide

Next slide

Back to first slide

View graphic version