Building Distance Vector Routing Table

1. Building Distance Vector Routing Table

2. Filling the global Distance victor Table

3. Filling the global Distance victor TableEach node will have 0 distance to itself. The diagonal will be all 0's.

4. Filling the global Distance victor TableEach node knows only the distances to its immediate neighbours. The nodes that are not neighbours will have a distance of ∞. The table is diagonally identical. The row A = column A. 12 3 ∞ 6 16 ∞ 12 3 ∞ 6 16 ∞

5. Filling the global Distance victor TableDo the same for each node.B column = B row 2 ∞∞ ∞∞ 2 ∞ ∞ ∞ ∞

6. Filling the global Distance victor TableDo the same for each node.C 4 ∞∞ ∞ 4 ∞ ∞ ∞

7. Filling the global Distance victor TableDo the same for each node.D, E, F and G ∞∞ 5 ∞ ∞ 5 ∞∞ ∞ ∞ 10 10

8. Filling the global Distance victor TableThe initial table is not complete. Each node will exchange the routing table with its neighbour to find the path to nodes with ∞.

9. Getting the updatesNode A will get update from B (+12) , C(+3), E (+6)and F (+16) and add the cost to reach each one. Compare the results and take the least distance.A table will be updated and the distance to B will be changed to 5 through next hop Cbecause 2+3 < 12 or any other values in the B row.7 is the least value at row D (next hop C)26 is the least value at row G (next hop F) Old table Updated Global distance table First update Take the least distance in the row (from column A,B,C,E & F only)

10. Getting the updatesThe same thing will happen to all Nodes in the table. Take node B.B will get updates from its direct neighbours A and C. Then it will add the cost and compare. Note: anything + ∞ = ∞ which is large. Old table Updated Global distance table First update Compare the cost and take the least

11. Getting the updatesThe same thing will happen to all Nodes in the table. Take node C. C will get updates from its direct neighbours A, B and D. Then it will add the cost and compare. Note: anything + ∞ = ∞ which is large. Old table Updated Global distance table First update Compare the cost and take the least

12. Since A row = A column and so on for B & CTry completing the table and find the new column for D, E, F and GFor D only update from C (+ 4) Old table Updated Global distance table First update

13. Try completing the table for D, E, F and GFor Eonly update from A (+ 6) Old table Updated Global distance table First update

14. Try completing the table for D, E, F and GFor Fonly update from C (+ 4) Old table Updated Global distance table First update

15. Try completing the table for D, E, F and GThe result should be This is the updated Global distance table after all nodes exchanges there first update Now we need to do the same calculation for the second update

16. Getting the second updatesNode A will get update from its neighbours and added the new cost to reach each one. B (+5) , C(+3), E (+6)and F (+ 16) and the same thing happens again.This time only cost to G will change to 12 through hop C Old table Old table Old table Global distance table after second updates for A

17. Complete for B Old table Old table Old table Global distance table after second updates

18. Complete for C Old table Old table Old table Global distance table after second updates

19. Complete for D Old table Old table Old table Global distance table after second updates

20. Complete for E Old table Old table Old table Global distance table after second updates

21. Complete for F Old table Old table Old table Global distance table after second updates