Spanning Tree in A Nutshell
Spanning Tree in A Nutshell
STP
Spanning-Tree Protocol (STP) prevents loops from being formed when switches or
bridges are interconnected via multiple paths. Spanning-Tree Protocol
implements the 802.1D IEEE algorithm by exchanging BPDU messages with other
switches to detect loops, and then removes the loop by shutting down selected
bridge interfaces. This algorithm guarantees that there is one and only one
active path between two network devices.
STP was invented by Dr Radia Perlman in 1985, distinguished engineer at Sun
Microsystems. Dr Perlman devised a method by which bridges can obtain Layer 2
routing utopia: redundant and loop-free operation. Think of spanning tree as a
tree that the bridge keeps in memory for optimized and fault-tolerant data
forwarding.
Spanning tree in a nutshell
The root bridge in a spanning tree is the logical centre and sees all traffic
on a network.
Newer protocols, such as TRILL, prevent loops while keeping links that
would be blocked by STP in service.
Feature
Default Setting
Bridge groups
Enabled.
Switch priority
32768. 4096-61440
Port priority
128.
10 Mb/s: 100.
100 Mb/s: 19.
1000 Mb/s: 4.
2 seconds.
Forward-delay interval
20 seconds.
30 seconds.