Consider a general topology (that is, not the specific network shown above) and
Chapter 4, Problem P29(choose chapter or problem)
Consider a general topology (that is, not the specific network shown above) and asynchronous version of the distance-vector algorithm. Suppose that at each iteration,a node exchanges its distance vectors with its neighbors and receives theirdistance vectors. Assuming that the algorithm begins with each node knowingonly the costs to its immediate neighbors, what is the maximum number of iterationsrequired before the distributed algorithm converges? Justify your answer.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer