Metraipolis › archive › dc_80b0ca4eb42f
Spanning Tree Protocol — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Spanning_Tree_Protocol
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:48:15.585Z
- SHA-256 of the archived text
2311a28b3fbcc20430c02ce62ab89c11b896c56c3e3f3a7ecee086996194b0b6- Stable URL of this page
https://metraipolis.com/documento/dc_80b0ca4eb42f
How to cite
Spanning Tree Protocol — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Spanning_Tree_Protocol (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_80b0ca4eb42f (Metraipolis archive dc_80b0ca4eb42f, sha256 2311a28b3fbcc20430c02ce62ab89c11b896c56c3e3f3a7ecee086996194b0b6)
BibTeX
@misc{dc80b0ca4eb42f,
title = {Spanning Tree Protocol — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Spanning_Tree_Protocol},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_80b0ca4eb42f; sha256 2311a28b3fbcc20430c02ce62ab89c11b896c56c3e3f3a7ecee086996194b0b6},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Spanning_Tree_Protocol. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to prevent bridge loops 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 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. 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. While STP is still in use today, in many modern networks its primary use is as a loop-protection mechanism rather than a fault tolerance mechanism. Link aggregation protocols such as LACP bond multiple links to provide link-level fault tolerance while simultaneously increasing overall link capacity. However, implementing switch-level redundancy requires multi-chassis link aggregation, of which only proprietary variants exist. Shortest Path Bridging combines both loop-free forwarding and link aggregation, but hasn't reached STP's or LACP's popularity yet, as of 2026. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «topology»). Fonte: Wikipedia in inglese, voce «Spanning Tree Protocol» — https://en.wikipedia.org/wiki/Spanning_Tree_Protocol Wikidata Q852555 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q852555 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Spanning_Tree_Protocol?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1359228455, consultata il 2026-10-07T22:22:34.735Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: daf87ae4cd69ad1d40277b752ad044a57076c0019be46724f5a8f7a2f6ab8979