
Using Transparent Bridge Services
114060 Rev. A 1-13
Figure 1-11 shows the resulting logical topology, which provides a loop-free
topology with only a single path between any two hosts.
Figure 1-11. Spanning Tree (Loop-Free) Logical Topology
It is very important to configure the spanning tree parameters correctly. Consider
the typical flow of traffic so that the logical topology that results from the
spanning tree algorithm is appropriate for the network.
If, in the network shown in Figure
1-8, a majority of traffic originates on LAN A
and is destined for LAN D, it is not practical to set the spanning tree parameters as
shown in Figure
1-12. This figure illustrates an inefficient spanning tree topology
for this network because the traffic from LAN A must traverse Bridge 1, LAN B,
and Bridge 2 to get to LAN D. LAN B is then congested with unnecessary traffic.
LAN C
LAN D
LAN B LAN A
BR 3
BR 2
BR 4BR 1
IF 1
IF 2 IF 3
IF 5
IF 6
IF 7
IF 8
All path costs are equal.
----And----
BR 2 = priority 1
BR 3 = priority 2
BR 4 = priority 3
BR 1 = priority 4
Then:
Bridge 1/Interface 1 is blocked.
Bridge 4/Interface 5 is blocked.
Loop-free topology
is created.
Result:
Interface (IF) number
denotes its priority.
Given:
BRG0008A
Comentarios a estos manuales