SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.

To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

Sharing the knowledge gained, is a generous way to change our world for the better. -Sr2Jr

 

#
Authors:
James F. Kurose, Keith W. Ross
Chapter:
The Network Layer
Exercise:
Problems
Question:32 | ISBN:9780132856201 | Edition: 6

Question

Consider the count-to-infinity problem in the distance vector routing. Will the count-to-infinity problem occur if we decrease the cost of a link? Why? How about if we connect two nodes which do not have a link?

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

  • No, the count-to-infinity problem occur if we decrease the cost of a link as according to the updates received the nodes find their new least costs and in turn send their updates for distance vector.

 

  • if we connect two nodes, the data cannot be propagated properly as face to cost-to-infinity problem and  the find the minimum cost paths results in errors.
0 0

Discussions

Post the discussion to improve the above solution.