4 votes 4 votes Correct or Incorrect: The count to infinity problem may arise in a distance vector routing protocol even when the network never gets disconnected. The given answer says that this statement is incorrect. But I think the problem arises even when the weight of link goes up(without the network being disconnected). As shown in this stackoverflow answer: https://stackoverflow.com/a/13523982/6430403 Computer Networks computer-networks distance-vector-routing count-to-infinity routing + – Rishabh Gupta 2 asked Jan 5, 2018 Rishabh Gupta 2 2.6k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply gari commented Jan 5, 2018 reply Follow Share count to infinity only arises when a link goes down... so no way to reach a node .. hence distance to that node is infinity. if the weight of the link goes up then still it would be finite distance ..hence in this case no count to infinity. 0 votes 0 votes Rishabh Gupta 2 commented Jan 26, 2018 reply Follow Share Even when the link cost increases, we say it as "COUNT TO INFINITY" problem. https://www.youtube.com/watch?v=_lAJyA70Z-o 3 votes 3 votes Please log in or register to add a comment.
0 votes 0 votes Incase the link goes down , the DVs goes to infinity . whereas when the link cost raises very high say W.then the DVs go up to the link cost not infinity Sai Shravan answered Jan 27, 2019 Sai Shravan comment Share Follow See all 0 reply Please log in or register to add a comment.