Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Spanning Tree Protocol

Graph Algorithm

The Spanning Tree Protocol, or STP, is a network protocol that builds a loop-free logical topology for Ethernet networks. Its basic job is to prevent bridge loops and the broadcast radiation they cause, while still letting a network design include backup links that provide fault tolerance if an active link fails. It works by computing a spanning tree over the connected layer-2 bridges and disabling the links that are not part of that tree, leaving a single active path between any two nodes. The underlying algorithm was invented by Radia Perlman while she worked for Digital Equipment Corporation. STP was standardized as IEEE 802.1D, was followed by the faster Rapid Spanning Tree Protocol in 2001, and is now incorporated into IEEE 802.1Q-2014.

Connections

Credited To

Source Spanning Tree Protocol (Wikipedia)

In Field

Source Spanning Tree Protocol (Wikipedia)

Invented By

Source Spanning Tree Protocol (Wikipedia)
In the Other Atlases

Developed By

Also in Business Atlas: the developer of this subject.

Sources
Spanning Tree Protocol (Wikipedia)
  • Lead section
    The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks.
  • Invented By: Radia Perlman, Lead
    STP is based on an algorithm that was invented by Radia Perlman while she was working for Digital Equipment Corporation.
  • Credited To: Radia Perlman, Lead
    STP is based on an algorithm that was invented by Radia Perlman while she was working for Digital Equipment Corporation.
  • In Field: Computer Networking, Lead
    The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.