Question
Consider the three-node topology shown in Figure 4.30. Rather than having the link costs shown in Figure 4.30, the link costs are c(x,y) = 3, c(y,z) = 6, c(z,x) = 4. Compute the distance tables after the initialization step and after each iteration of a synchronous version of the distance-vector algorithm (as we did in our earlier discussion of Figure 4.30).
Answer
Consider the cost of the links as follows:
Construct the matrix as follows:
According to the distance vector algorithm, any node m computes the distance vector using the following formulas:
Note: NA is used when there is no distance.
The distance tables at the node x after initialization step are as follows:
The distance tables at the node y after initialization step are as follows:
The distance tables at the node y after initialization step are as follows:
