HP 3100 Series, Configuration Manual

Page: 60 / 225

51
{
The configuration BPDU with the lowest root bridge ID has the highest priority.
{
If configuration BPDUs have the same root bridge ID, their root path costs are compared.
For example, the root path cost in a configuration BPDU plus the path cost of a receiving
port is S. The configuration BPDU with the smallest S value has the highest priority.
{
If all configuration BPDUs have the same ports value, their designated bridge IDs,
designated port IDs, and the IDs of the receiving ports are compared in sequence. The
configuration BPDU that contains the smallest ID wins.
A tree-shape topology forms when the root bridge, root ports, and designated ports are selected.
Figure 14 describes with an example how the STP algorithm works. This example shows a simplified
spanning tree calculation process.
Figure 14 The STP algorithm
As shown in Figure 14 , the priority values of Device A, Device B, and Device C are 0, 1, and 2, and
the path costs of links among the three devices are 5, 10, and 4, respectively.
4.
Initial state of each device
Table 10 Initial state of each device
Device Port name
Configuration BPDU on the
port
Device A
Port A1 {0, 0, 0, Port A1}
Port A2 {0, 0, 0, Port A2}
Device B
Port B1 {1, 0, 1, Port B1}
Port B2 {1, 0, 1, Port B2}
Device C
Port C1 {2, 0, 2, Port C1}
Port C2 {2, 0, 2, Port C2}
NOTE:
In Table 10 , each configuration BPDU contains the following fields: root bridge ID, root path cost,
designated bridge ID, and designated port ID.
5.
Comparison process and result on each device
Device A
Priority = 0
Device B
Priority = 1
Device C
Priority = 2
Port A1 Port A2
Port B1
Port B2
Port C1
Port C2
P
at
h
co
st
=
5
P
ath
co
st
= 1
0
Path cost = 4