-
To help ensure that messages will arrive over all possible paths.
-
To provide a path between every LAN segment.
-
To discover a "loop free" topology and provide, as possible, a path between every pair of LAN's
-
To keep routing updates from being transmitted onto the same port on which they were received.
EXPLANATION
The spanning tree algorithm is a requirement in meshed
transparent bridging. As a transparently bridged frame contains no
record of the path it has taken, and contains no mechanism for aging,
any bridge loop will result in storms of packets continually circulating
around the loop. By providing a loop-free path between any two points
in the network, the spanning tree algorithm prevents these storms. A
form of this algorithm is also used for Explorer control in source-route
bridges.
0 comments:
Post a Comment