Spanning tree

Spanning Tree Protocol (STP) is a network protocol level OSI layer 2 (data link layer). It is based on an algorithm designed 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. At present, we recommend using the standardized version of the IEEE.

Its function is to manage the presence of loops in network topologies due to the existence of redundant links (necessary in many cases to ensure the availability of connections). The protocol allows interconnection devices automatically enable or disable connection links, so as to ensure that the topology is loop-free. STP is transparent to the user stations.

If the STP configuration changes, or if one network segment becomes unreachable redundant, the algorithm reconfigures the connections and restores connectivity, enabling a standby links. If the protocol fails, it is possible that both connections are active simultaneously, which could lead to an endless loop of traffic on the LAN.

There are many variants of Tree Protocol Spaning mainly due 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 choose a new root bridge.

Popularity: 1% [ ? ]