Consider the network shown below
The nodes in the network run the distance vector routing algorithm. Which of the following computed as the final distance vectors at nodes D after all updates are exchanged among routers? Assume that the nodes only know their distances to their direct neighbors initially.
1
|
from
|
to |
A |
B |
C |
D |
|
A |
0 |
6 |
4 |
3 |
|
|
C |
4 |
2 |
0 |
1 |
|
|
D |
3 |
3 |
1 |
0 |
2
|
from
|
to |
A |
B |
C |
D |
|
A |
0 |
7 |
4 |
3 |
|
|
C |
4 |
2 |
0 |
1 |
|
|
D |
3 |
10 |
1 |
0 |
3
|
from
|
to |
A |
B |
C |
D |
|
A |
0 |
6 |
4 |
3 |
|
|
C |
4 |
2 |
0 |
1 |
|
|
D |
3 |
10 |
1 |
0 |
4
None of these