Figure 3-54. Displaying The Spanning Tree Algorithm - SMC Networks 8748L2 Management Manual

C
ONFIGURING THE
• Root Forward Delay – The maximum time (in seconds) this device
will wait before changing states (i.e., discarding to learning to
forwarding). This delay is required because every device must receive
information about topology changes before it starts to forward frames.
In addition, each port needs time to listen for conflicting information
that would make it return to a discarding state; otherwise, temporary
data loops might result.
• Transmission limit – The minimum interval between the
transmission of consecutive RSTP BPDUs.
• Path Cost Method – The path cost is used to determine the best path
between devices. The path cost method is used to determine the range
of values that can be assigned to each interface.
Web – Click Spanning Tree, STA, Information.

Figure 3-54. Displaying the Spanning Tree Algorithm

3-116
S
WITCH