STP

A LAN with hub/switch/bridge must form a tree -- there is only one path between any two computers nodes. If more than one parallel path exists, a loop would have been formed and an endless circulation of frames can happen in the loop. This circulation can eventually break down the network by occupying all the bandwidth. To prevent this from happening, IEEE has defined the spanning-tree algorithm (STA) in IEEE 802.1d. The algorithm detects loops and disables all the parallel paths. The STA also specified the behavior when a network connection goes down (eg. digger breaks a buried cable), in that case an alternative path will be enabled automatically.

The Spanning Tree Protocol (STP), is a link-management protocol that is part of the IEEE 802.1 standard for bridges and switches. STP uses the spanning-tree algorithm (STA) to prevent network loops and provide path redundancy in a LAN.

Mathematically, spanning tree protocol is to build and maintain a minimal spanning tree for connected nodes.

The STA finds the shortest path for a frame to move from source node (computer A) to destination node (computer B) via the network edges (cables connections in between).

The math model might be simple, but we need to get into details of how LAN switches establish the spanning tree with STP. The STA algorithm creates a hierarchical tree spanning the entire network, including all bridges and switches. The STA finds all the redundant paths and makes only one of them active at any given time. If a network segment becomes unreachable, the STA reconfigures the logical topology, reestablishing the link by activating the standby path.

Here is another example of STP convergence.

Cisco Lab

We will revisit root bridges, root ports and designated ports in the next section.

[ICND1 and ICND2 break down]