Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Spanning Tree Protocol
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Network protocol that builds a loop-free logical topology for Ethernet networks}} {{IPstack}} The '''Spanning Tree Protocol '''('''STP''') is a [[network protocol]] that builds a loop-free [[logical topology]] for [[Ethernet network]]s. The basic function of STP is to prevent [[bridge loop]]s and the [[broadcast radiation]] that results from them. Spanning tree also allows a [[network design]] to include backup links providing [[fault tolerance]] if an active link fails. As the name suggests, STP creates a [[spanning tree]] that characterizes the relationship of nodes within a network of connected layer-2 [[Network bridge|bridges]], and disables those links that are not part of the spanning tree, leaving a single active path between any two network nodes. STP is based on an algorithm that was invented by [[Radia Perlman]] while she was working for [[Digital Equipment Corporation]].<ref name="perlman paper">{{cite journal|last=Perlman|first=Radia|author-link=Radia Perlman|title=An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN|journal=ACM SIGCOMM Computer Communication Review|volume=15|issue=4|pages=44β53|year=1985|doi=10.1145/318951.319004|s2cid=61172150|url=https://semanticscholar.org/paper/933d8fc9b5ddc0e5e12116c1eb309ab535e6ae75}}</ref><ref> {{cite book | last = Perlman | first = Radia | author-link=Radia Perlman | year = 2000 | title = Interconnections, Second Edition | publisher = Addison-Wesley | location = USA | isbn = 0-201-63448-1 }}</ref> In 2001, the [[IEEE]] introduced '''Rapid Spanning Tree Protocol''' ('''RSTP''') as 802.1w. RSTP provides significantly faster recovery in response to network changes or failures, introducing new convergence behaviors and bridge port roles to do this. RSTP was designed to be backwards-compatible with standard STP. STP was originally standardized as [[IEEE 802.1D]] but the functionality of spanning tree (802.1D), rapid spanning tree (802.1w), and [[Multiple Spanning Tree Protocol]] (802.1s) has since been incorporated into [[IEEE 802.1Q-2014]].<ref name="802.1Q">[http://www.ieee802.org/1/pages/802.1Q-2014.html Bridges and Bridged Networks]</ref> While STP is still in use today, in most modern networks its primary use is as a loop-protection mechanism rather than a fault tolerance mechanism.{{citation needed|date=March 2023}} [[Link aggregation]] protocols such as [[Link aggregation#Link Aggregation Control Protocol|LACP]] will bond two or more links to provide fault tolerance while simultaneously increasing overall link capacity.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)