Consider the following network example. Suppose that the distance vector (DV) routing algorithm is used to compute the distance between nodes.
(a) Show the procedure of nodes X, Y and W computes their Distance Vector for network illustrated by Figure (a), i.e., link costs are C(xw)=1, C(xy)=4, and C(yw)=8.
Answer: In the following, each column shows the node X, Y and Z's table update respectively:
(b) Assume that after the DV is computed by all nodes, the link cost of xy changed from 4 to 20. Show the procedure of nodes X, Y and W updates their Distance Vector for network illustrated by Figure (b), i.e., link costs are C(xw)=1, C(xy)=20, and C(yw)=8.