
Configuring Bridging Services
1-12 114060 Rev. A
Figure 1-10. Root Port Determination (Equal Path Costs and Root Interface Priorities)
The spanning tree algorithm selects a bridge on each LAN as the designated
bridge. The root port of this bridge has the lowest-cost path to the root bridge.
All bridges turn off (set to blocking state) all of the lines except for the single
line that is the shortest-cost path to the root and any line attached to the LANs
for which the bridge serves as a designated bridge.
4. Elect a designated port.
The spanning tree algorithm selects the port that connects the designated
bridge to the LAN as the designated port. If there is more than one such port,
the spanning tree algorithm selects the port with the lowest priority as the
designated port. This port, which carries all extended network traffic to and
from the LAN, is in the forwarding state.
Thus, the spanning tree algorithm removes all redundant ports (ports providing
parallel connections) from service (places in the blocking state). If there is a
topological change or a bridge or data-path failure, the algorithm derives a new
spanning tree that may move some ports from the blocking to the forwarding
state.
For example, in Figure
1-8, if all path costs are equal and Bridge 2 has the
lowest-bridge priority (followed by Bridge 3, Bridge 4, and Bridge 1), the
spanning tree algorithm may block Bridge 1/Interface 8 and Bridge 4/Interface 9
from service.
LAN A
IF 3
IF 1
IF 1 = priority 1
IF 2 = priority 1
IF 4
LAN B
IF 2
IF 3 = priority 3
IF 4 = priority 2
Path costs from IF 3 to root bridge and
from IF 4 to root bridge are equal.
---------AND--------
IF 4 becomes root port because it has
a better priority than IF3.
Root
Bridge
Bridge A
Given:
Then:
Same
priority
BRG0007A
Kommentare zu diesen Handbüchern