Specifications

Functions
RS2-4R
Release 1.0 03/04
4.4 Spanning Tree Algorithm
107
4.4.3 Example: manipulation of a tree structure.
The management administrator of the network (see Fig. 35) soon discovers
that this configuration, with bridge 1 as its root bridge, is unfavorable. The
control packets that bridge 1 sends to the other bridges are concentrated on
the paths between bridge 1 and bridge 2 and between bridge 1 and bridge 3.
If the management administrator raises bridge 2 to the root bridge, the load
caused by the control packets will be more evenly distributed among the sub
-
networks. This would result in the configuration shown (see Fig. 35). The
paths between the individual bridges and the root bridge have become
shorter.
Fig. 36: Example of a root path manipulation
Bridge 5
Bridge 1
Bridge 6
Root path
Bridge 4
Bridge 3
Bridge 2
Port 3
Port 1 Port 2
BID
BID = 60 BID = 40
BID = 30
BID = 50BID = 20BID = 70
BID = 10
Bridge 7
Redundant path
Bridge identification