For the network given in the figure below, the routing tables of the four nodes A, E, D and G are shown. Suppose that F has estimated its delay to its neighbors. A, E, D and G as 8, 10, 12 and 6 msec respectively and updates its routing table using distance vector routing technique.
A | 8 |
B | 20 |
C | 17 |
D | 12 |
E | 10 |
F | 0 |
G | 6 |
A | (8)(34)(32)(27)min(F→A,F→E→A,F→D→A,F→G→A)=(8) |
B | (48)(37)(20)(30)min(F→A→B,F→E→B,F→D→B,F→G→B)=(20) |
C | (22)(17)(42)(28)min(F→A→C,F→E→C,F→D→C,F→G→C)=(17) |
D | (25)(30)(12)(25)min(F→A→D,F→E→D,F→D→D,F→G→D)=(12) |
E | (29)(10)(12)(28)min(F→A→E,F→E→E,F→D→E,F→G→E)=(10) |
F | F→F |
G | (32)(32)(34)(6)min(F→A→G,F→E→G,F→D→G,F→G→G)=(6) |