D-Link DGS-3627 Product Manual - Page 216
Constructing a Shortest Path Tree
UPC - 790069293696
View all D-Link DGS-3627 manuals
Add to My Manuals
Save this manual to your list of manuals |
Page 216 highlights
xStack® DGS-3600 Series Layer 3 Managed Gigabit Ethernet Switch Figure 4- 36. Constructing a Shortest Path Tree Figure 4- 37. 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: 200
xStack
®
DGS-3600 Series Layer 3 Managed Gigabit Ethernet Switch
Figure 4- 36. Constructing a Shortest Path Tree
Figure 4- 37. 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:
200