3 Step Updating in Distance Vector Routing To Cost A 2 B 4 To Cost Next A 4 B 6 C D 00000 Compare To Cost Next B 5 || | || 05238 ABCDE Apr-2 E 4 Received from C E 6 C A's Modified Table To Cost Next A 0 BCDE 5236 6 C A's NewTable A's Old Table 13 TA BC Cost Next Cost Next 0 A 6 6 D E 4 BCDE B 0 C 7 D 8 --- E F 5 FL 8 Router A's table Router B's table Cost Next Cost Next A A B 7 B 8 0 --- C D E 9 DE D 0 E F F Router C's table Router D's table Router C's table To PABCD E F Cost 4 80808 Router D's table Next To Cost Next --- A 5 --- Router E's table --- BCD E F 0 Router F's table To = Available network destinations Cost = The number of hops to reach the network Next = The next hop toward the destination infinity (network unknown, cannot be reached) ---no next hop or unknown --- Router A receives an update from Router B etc... To Cost Next A B C D LU E F Router A's modified table To Cost Next A B C D E F Router A's final table After processing B's data, Router A receives an update from Router C etc... To Cost Next To Cost Next A A B C D E LL F Router A's modified table B C D E LL F Router A's final table After a) and b) were processed, Router F receives an update from Router B etc... To Cost Next To Cost Next A B A B C D E F Router F's modified table C D E F Router F's final table Routes unknown at the beginning: Routes still unknown at the end after completing (a,b,& c)