Consider the network shown above and assume that each node i

Consider the network shown above, and assume that each node initially knows the costs of to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z.

Solution

Routing Table at Node Z:

Destination Cost NextHop

U 6 V

V 5 V

X 2 X

Y 6 X

In distance algorithm each node contains the distance for their neighbour nodes and transfer or sent that list to it\'s neighbour nodes.

Based on that sended list every node decides the shortest path for other nodes and update their own table with those costs.