Question: Consider three types of graphs - (1) fully connected, (2) star, (3) ring and (4) line as shown below in figure. Assume each graph

Consider three types of graphs - (1) fully connected, (2) star, (3) ring and (4) line as shown below in figure. Assume each graph has n node. After how many iterations the distance vector algorithm will converge? Why? Explain your answer. Assume that at the beginning, nodes only know the cost to their neighbors. Fully Connected Star Ring Line
Step by Step Solution
3.49 Rating (162 Votes )
There are 3 Steps involved in it
Hence it luill eterate Fully lenneted Distance veco... View full answer
Get step-by-step solutions from verified subject matter experts
