Consider the following network Using distancevector algorith

Consider the following network. Using distance-vector algorithm, show the distance tables at node \'a\' from initialization till convergence.

Solution

[ A B C D ]

vector table of A 0 1 3 7

vector table of B 1 0 1 3

vector table of C 3 1 0 2

vector table of D 7 3 2 0

[ A B C D ]

Routing table of A via B is ( 0 1 2 4 ) provides the best path