Distance Vector Approach

six node network bellman ford algorithm
six node network bellman ford algorithm

if node i can get information from its neighbour about minimum cost of the minimum cost path to a destination, it can then determine the cost to the destination by adding direct link cost dik


distance vector
distance vector view

in distance vector routing protocol, router informs its neighbours of topology changes periodically.

The term distance vector refers to the fact that the protocol manipulates vectors (arrays) of distances to other nodes in the network


credits : wikipedia.org


Leave a Reply

Your email address will not be published. Required fields are marked *