A network administrator connects several new switches in a redundant topology to ensure high availability. Place the steps of the initial IEEE 802.1D Spanning Tree Protocol (STP) convergence process in the correct chronological order from link startup to topology stabilization.
- 1Switches boot up and transmit Bridge Protocol Data Units (BPDUs) claiming themselves as the Root Bridge.
- 2Switches process received BPDUs and elect the single switch with the lowest Bridge ID as the Root Bridge.
- 3Each non-root switch evaluates path costs and selects one Root Port offering the shortest path to the Root Bridge.
- 4Switches elect a single Designated Port for each network segment based on the lowest root path cost.
- 5All remaining switch ports that are neither Root Ports nor Designated Ports transition to the Blocking state.
Answer
The correct chronological order of IEEE 802.1D STP convergence is: 1) Switches originate BPDUs claiming to be the Root Bridge, 2) The switch with the lowest Bridge ID is elected as the Root Bridge, 3) Non-root switches elect their Root Ports, 4) Segment-level Designated Ports are elected, and 5) Remaining redundant ports enter the Blocking state.
The standard IEEE 802.1D STP algorithm operates sequentially: switches announce themselves as root via initial BPDUs, elect the true Root Bridge based on the lowest Bridge ID, select Root Ports on non-root switches, designate single forwarding ports per segment, and block remaining redundant links to eliminate loops.
Step-by-Step Solution
Key Concept
Spanning Tree Protocol Convergence Sequence