QT
Spanning tree
Spanning Tree Protocol (STP) is a network protocol level 2 of the OSI layer (data link layer). It is based on an algorithm developed by Radia Perlman while working for DEC. There are 2 versions of STP: the original (DEC STP) and standardized by the IEEE (IEEE_802.1D), which are not compatible. Currently, we recommend using version standardized by the IEEE.
Its function is to manage the presence of loops in network topologies due to the existence of redundant links (necessary in most cases to ensure the availability of connections). The protocol allows devices to automatically turn on / off interconnection connecting links so as to ensure that the topology is free of loops. STP is transparent to the user stations.
If the STP configuration changes, or if a redundant network segment becomes unreachable, the algorithm reconfigures and restores connectivity links, activating a link in reserve. If the protocol fails, it is possible that both connections are active simultaneously, which could lead to an infinite loop of traffic on the LAN.
There are multiple variants of Spaning Tree Protocol, due primarily to the time it takes for the algorithm used to converge. One of these variants is the Rapid Spanning Tree Protocol
The Spanning Tree (Spanning tree) remains in effect until a change occurs in the topology, a situation that the protocol is able to detect automatically. The maximum duration of the spanning tree is five minutes. When one of these changes, the current root bridge redefines the spanning tree topology or choosing a new root bridge.
Popularity: 1%
