xStack® DGS-3120 Series Layer 3 Managed Gigabit Ethernet Switch Web UI Reference Guide
179
Figure 5-28 Constructing a Shortest Path Tree
Figure 5-29 Constructing a Shortest Path Tree
The diagram above shows the network from the viewpoint of Router A. Router A can reach 192.213.11.0 through
Router B 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 Router 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:
Summary of Contents for xStack DGS-3120 Series
Page 1: ......