T=0 from Avia Avia Bvia Cvia Dto Ato B3to C23to D from Bvia Avia Bvia Cvia Dto A3to Bto C2to D from Cvia Avia Bvia Cvia Dto A23to B2to Cto D5 from Dvia Avia Bvia Cvia Dto Ato Bto C5to D At this point, all the routers (A, B, C, D) have new "shortest-paths" for their DV (the list of distances that are from them to another router via a neighbor). They each broadcast this new DV to all their neighbors: A to B and C, B to C and A, C to A, B, and D, and D to C. As each of these neighbors receives this information, they now recalculate the shortest path using it.
T=0 from Avia Avia Bvia Cvia Dto Ato B3to C23to D from Bvia Avia Bvia Cvia Dto A3to Bto C2to D from Cvia Avia Bvia Cvia Dto A23to B2to Cto D5 from Dvia Avia Bvia Cvia Dto Ato Bto C5to D At this point, all the routers (A, B, C D) have new "shortest-paths" for their DV (the list of distances that are from them to another router via a neighbor). They each broadcast this new DV to all their neighbors: A to B and C, B to C and A, C to A, B, and D, and D to C. As each of these neighbors receives this information, they now recalculate the shortest path using it.