At the beginning each node knows only the distances to its immediate neighbors. In step 1, each node exchanges its routing table with all of its neighbors and all update their routing tables accordingly. In step 2, step 1 repeats. After step 2, at node A, what are the costs associated with nodes B,C,D and E.
After the algorithm converged, suppose the link D to C were to break. What are the costs that node A maintains to nodes B, C, D and E after D informs node A of failure of the link?
After convergence, focusing on node B and specific routing entry within corresponding to node D. If the cost of the link B-C were to change, for what value of the change will node B inform its neighbors of a new minimum cost path to D? What will be the new value of the B-C link. Assume cost values are always >=1.
