Spanning Tree Protocol

The Spanning Tree Protocol’s purpose is preventing bridging loops and allows a network to quick recover if the primary path fails. STP was invented by Radia Perlman from the Digital Equipment Corporation.

Spanning-Tree Protocol is a way to have redundant paths and stop loops from having. All Ethernet networks only work well if there is only one path between two points. Having many different paths will cause loops in a network. This cause frames to be duplicated. The Spanning-Tree protocol will define all switches in the network. The algorithm will automatically change the STP topology by activating or inactivating certain paths, so that only one path will be present between two points. The end-devices do not know they are connected to one network or many networks.

Election of the Root Switch The switches in the network gather information with the exchange of data messages. These are called bridge protocol data units (BPDUs). There is an election for a root switch on every LAN segment. To stop loops STP by putting redundant switches ports into a backup state. The root switch is the place where the STP algorithm runs. All other paths not needed to reach the root switch are put in to backup mode

Root Switch Variables

Variable	Description
Hello Time	How often a hello is broadcasted to the other switches, so the switch knows the other switches are functioning.
Maximum Age Timer	Defines how long a bridge or switch should wait after the last received hello message before believing that the network topology has changed.
Forward Delay Timer	Time the switch has spent learning/listening before it begins forwarding traffic.