Specifications

Web-based management
RS2-4R
Release 1.0 03/04
5.5 Switching
161
5.5.3 Rapid Spanning Tree
The Rapid Spanning Tree algorithm (RSTP) reduces the entire topology of
a network connected by bridges to a single tree structure. The root bridge
forms the basis of a tree structure. Ring structures are separated according
to specified rules. If a path is interrupted, the algorithm cancels the division
in order to maintain the data transmission. This enables redundant
connections for increased data security (see
“Spanning Tree Algorithm” on
page 101).
The structure of the tree depends on the root path costs.
D The structure is selected so that the path costs between each individual
bridge to the root bridge are kept to a minimum.
D In the case of a number of paths with the same root path costs, the priority
of the bridge identification of the bridge connected to one of these paths
decides which bridge should block.
Note: The lowest numerical value signifies the highest priority.
RSTP is compatible with the standard STP. However, the advantages of
faster reconfiguration with the RSTP between two bridges are lost if one of
the bridges only uses the STP protocol.
U Global settings
These settings apply to the basis board. The administrator usually enters
the values to be set for "Hello Time", "Forward Delay" and "Max. Age" in
the root bridge. The root bridge then transfers this data to the other brid
-
ges. The dialog displays the data received from the root bridge in the left
column. In the right column you enter the values which shall apply when
this bridge becomes a root bridge.
Note: Because HIPER-Ring and STP use different redundancy concepts,
the active RM function prevents enabling of STP