Process for Computing Distance-Vector Tables:
In this topology:
a. Each node knows only the distances to its immediate neighbors:
Node | Neighbors | Distances |
---|---|---|
A | B, D | 8, 3 |
B | A, E, F | 8, 1, 2 |
C | D, E, F | 3, 2, 2 |
D | A, C | 3, 6 |
E | B, C, F | 1, 2, 2 |
F | B, C, E | 2, 2, 2 |
b. Each node has reported the information it had in the preceding step to its immediate neighbors: This would be the same as the initial step since each node only knows about its immediate neighbors.
c. Step (b) happens a second time: Again, this would be the same as the initial step since there have been no changes to the information exchanged between nodes.
Answered By