background image
Bridging, Switching, and Spanning Tree 159
Figure 4-14
Looping Without the Spanning-Tree Protocol
Frames addressed to PC3's MAC address will loop forever--or at least until time is no more!
No mechanism defined in Ethernet marks the frame to be thrown away by a bridge, similar to
the way an IP router uses the time-to-live field. The frame destined to PC3 would be forwarded
because the bridges do not have PC3's MAC address in their bridge tables. Similarly, bridges
forward broadcasts on all interfaces, so if PC1 or PC2 sent a broadcast, the broadcast would
loop for a long time.
Of course, having only one physical path between segments is a poor design for availability. If
any part of that one path failed, the network would be broken into separate parts whose devices
could not communicate. So, there is a need for physical redundancy, but with only one active
path because transparent bridging logic will not tolerate multiple active paths. The solution is
to build bridged networks with physical redundancy and to use Spanning Tree to dynamically
block some interface(s) so that only one active path exists at any instant in time.
Finally, any possibility of loops occurring during the process of converging to a new Spanning
Tree must be avoided. Consider Figure 4-15, particularly Bridges 4 and 5. If a loop occurred in
this network, frames would rotate forever and the number of frames would grow. A frame on
either segment that both Bridges 4 and 5 are attached to would be forwarded by both bridges,
duplicating the frames. In a few short seconds, all LAN segments would be filled with copies
of the frames that occurred during the loop, possibly preventing the Spanning-Tree Protocol
from completing its task of re-creating the loop-free environment.
PC1
PC2
PC3
(turned off)
ch04.fm Page 159 Monday, March 20, 2000 5:02 PM