#1 Download computer science & engineering books free           #2 Display your sponsored posts here. Reach 10,000+ students. Contact: info[at]cpentalk.com for quote           #3 Take the Ultimate Trivia Quiz. See where you rank globally.
0 votes
in Computer Networks by (user.guest)

1 Answer

0 votes
by (user.guest)
Best answer

The Distance Vector Routing Algorithm suffers from count-to-infinity problem.

• The count-to-infinity problem does not occur when the cost of a link is decreased.

• When a node detects the decrease in the cost of a link, it updates its distance vector and informs its neighbors about the change in its distance vector.

• In the further iterations, according to the updates received the nodes compute their new least costs and in turn send their updates. Hence it reaches an inactive state.

When the two nodes are connected with a new link, then the previously connected node and its cost is not existed, Hence, it decreases the cost from infinity to the new cost of the link. Thus, there is no chance of the count to infinity problem for the new node.

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

Related questions

Welcome to CPEN Talk
Solution-oriented students of computer engineering on one platform to get you that


Chuck Norris' Internet connection is faster upstream than downstream because even data has more incentive to run from him than to him.