D-Link DGS-3312SR [146/290] Shortest path tree

DGS-3312SR Stackable Gigabit Layer 3 Switch

Shortest Path Tree

To bui er A’s shortest path tree for iagramed below, Router A is put at the root of the tree and the

smallest cost link to each destination network is calculated.

ld Rout the network d

Figure 5- 16. Constructing a Shortest Path Tree

Router A

Router B

128.213.0.0

Router C

Router D

192.213.11.0

222.211.10.0

5- 17. Constructing a Shortest Path Tree Figure

The diagram above shows the network from the viewpoint of Router A. Router A can reach 192.213.11.0 through Router B

er D with a cost of 10+5+10=25, but the cost is higher than the route

through Router C. This higher-cost route will not be included in the Router A’s shortest path tree. The resulting tree will

look like this:

with a cost of 10+5=15. Router A can reach 222.211.10.0 through Router C with a cost of 10+10=20. Router A can also

reach 222.211.10.0 through Router B and Rout

133