Login

0 votes

Best answer

**Distance-Vector Routing Algorithm:**

• The Distance Vector algorithm is an iterative, asynchronous and distributed way to determine the best path for the data packets based in the distance from each router in a network.

• Each router in the network maintains a Distance vector and routing table to save the distance from a receiving router.

• The cost of the least-cost path from node x to node y is represented by ** d(x)** can be calculated using the formula,

• The node’s distance at each step is the node’s distance vector with a decreasing value.

• When the distance values obtained at each node are in decreasing manner, the node simply knows the minimum cost path from its routing table.

• So, it updates the values in distance vectors.

• When the link costs are in increasing manner, then they need to compute its new minimum cost path and then send the updated costs to the routing tables.

• Every node computes the minimum cost paths from the updated routing tables and sends them over the link resulting in increasing the count of steps.

Thus, ** d(x)** will eventually stabilize the finite number of steps in Distance-Vector routing algorithm.

If you found this answer helpful, please upvote and share with other students in your network.