1. Consider the network with nodes A, B, C, and D. The edges show the cost to get from one node to another (the costs are bi-directional). The nodes use distance vector routing to compute the shortest path. Assume that each node distributes the same distance vector (DV) to all of its neighbors.
The figure below shows the DV distributed by each node to its neighbors before Round 1. Lets define Round 1 to be when every node sends its DV to every other node. For example, at the end of Round 1, A receives a DV table from B, C, and D.
Draw the distance vectors computed by nodes A, B, C, and D in Round 2 (after all the DVs are
received). Draw the distance vector in the same format as shown below. (10 points)
Round 1
B
Node A's DV Cost Next
Node B's DV Cost Next
40
8
Dest.
Dest.
1
40
A
40
B
B
A
C
2
C
c
1
c
2
60
D
D
8
D
c
Node C's DV
Node D's DV Cost Next
Dest.
Cost
Next
Dest.
A
2
A
A
B
1
B
B
8
B
D
60
D
C
60
C