To understand how the distance vector algorithm in Table 20.1 works, let us apply it to a four-node internet as shown in Figure 20.32.

Table 20.1

Assume that all nodes are initialized first. Also assume that the algorithm is applied, one at a time, to each node respectively (A, B, C, D). Show that the process converges and all nodes will have their stable distance vectors.

Transcribed Image Text:

5 4 3 A B D Distance_Vector_Routing ( ) // Initialize (create initial vectors for the node) D[myself] = 0 4-