Tell me what is Distance Vector Routing Protocols?

 finding the best route for data packets based on the distance

Simple routing protocol use to decide the best packet forwarding path.

Whenever different networks connect with each other to communicate and to share the data and resources, it is called internetworking. For internetworking, routers must be used on each network or at backbone to route the packets.

It used the distance vector routing , every nodes have its nearest distance router information. It calculate the distance using its distance vector with out its intermediate router info . It gave the destination router info with its least distance . It is used in RIP V1 RIP V2 and IGRP . it is first used in Bell Mann Ford algorithm.

Distance vector routing is a simple routing protocol used in packet-switched networks that utilizes distance to decide the best packet forwarding path. Distance is typically represented by the hop count.

It is one of the major class of intra domain routing protocol. It requires router that inform its neighbors of topology and changes periodically. in this process, computational complexity is less and message overhead is also less when compared to link state protocol. 

The basis:  Each node constructs a one-dimensional array containing the "distances"(costs) to all other nodes and distributes that vector to its immediate neighbors.

• The starting assumption for distance-vector routing is that each node knows the cost of the link to each of its directly connected neighbors.

1. A link that is down is assigned an infinite cost.