STP, animated

STP: physical redundancy, a single logical path

Every mechanism has a step-by-step animation, the configuration explained line by line and the exam notes. Where a parameter changes the outcome, you get a simulator in which you change it yourself.

BPDU / ProposalAgreementTCNBPDU with TCTCAdata / broadcast blocked port or failed linklink in forwarding

TL;DR

STP prevents layer 2 loops: the switches elect a root bridge by Bridge ID, each one chooses its cheapest path to it, and on each segment a single port remains designated — the rest block. 802.1D reaches forwarding in 30–50 seconds, on timers; RSTP gets there in milliseconds, through proposal / agreement and alternate ports computed in advance. The Cisco variants run one tree per VLAN (PVST+, Rapid PVST+), and MST groups the VLANs into a few instances. The edge protections — PortFast, BPDU Guard, Root Guard, Loop Guard, UDLD — and the integration with FHRP, EtherChannel and service provider networks complete the picture.

How to read the notes: red = critical for the exam, green = theory, blue = numbers, yellow = pitfalls, cyan = IEEE ↔ Cisco differences. In the animations, the configuration lines used at the current step are highlighted automatically; the ← → arrows change the step when the animation is focused.

The analogy, in short

Think of a building with hallways that close in circles. A reception desk is chosen (root bridge), each office chooses its shortest path to it (root port), on each hallway a single office is responsible (designated), and the remaining doors are locked, with the key in plain sight (alternate).

The model holds up to §6. From §7 on (per-VLAN trees, MST, integrations), it breaks; see the full analogy and its limits in §13.