Question: 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 .
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
![Distance_Vector_Routing ( ) // Initialize (create initial vectors for the node) D[myself] = 0 4-](https://dsd5zvtm8ll6.cloudfront.net/si.question.images/images/question_images/1544/8/0/0/3205c13c8405b9ac1544782874654.jpg)

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.
5 4 3 A B D Distance_Vector_Routing ( ) // Initialize (create initial vectors for the node) D[myself] = 0 4-
Step by Step Solution
3.44 Rating (170 Votes )
There are 3 Steps involved in it
The following shows the initialization and two rounds of updates Although the process ... View full answer
Get step-by-step solutions from verified subject matter experts
