Distance-Vector method Initial Table for a Dest Cost Next p A 0 A F CDEF D o A 4 E B 6 F dea At any time, have cost/next hop of best known path to destination Use cost oo when no path known Initially Only have entries for directly connected nodes 9/28/2006 Lecture 10: Intra-Domain routing 79/28/2006 Lecture 10: Intra-Domain Routing 7 Distance-Vector Method • Idea • At any time, have cost/next hop of best known path to destination • Use cost  when no path known • Initially • Only have entries for directly connected nodes A E F C D B 2 3 6 4 1 1 1 3 Initial Table for A Dest Cost Next Hop A 0 A B 4 B C  – D  – E 2 E F 6 F