xStack
®
DGS-3620 Series Layer 3 Managed Stackable Gigabit Switch Web UI Reference Guide
164
To build Router A’s shortest path tree for the network diagramed below, Router A is put at the root of the tree and
the smallest cost link to each destination network is calculated.
Shortest Path Tree
Figure 5-18 Constructing a Shortest Path Tree
Figure 5-19 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
To Next Page
Loading...
