About: Spanning Tree Protocol

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Spanning Tree Protocol Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

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. 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 (802.1s) has since been incorporated into IEEE 802.1Q-2014.

Attributes	Values
rdf:type	Thing software
rdfs:label	Spanning Tree Protocol (en)
rdfs:comment	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. 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 (802.1s) has since been incorporated into IEEE 802.1Q-2014. (en)
differentFrom	Real Time Streaming Protocol
sameAs	Spanning Tree Protocol Spanning Tree Protocol Spanning Tree Protocol
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Citation_needed dbt:Cite_web dbt:Commons_category dbt:Distinguish dbt:Efn dbt:IEEE_standards dbt:IETF_RFC dbt:Main dbt:Math dbt:Multiple_image dbt:Notelist dbt:Reflist dbt:Rp dbt:Sfrac dbt:Short_description dbt:Times dbt:Elucidate dbt:IPstack dbt:MACaddr
Subject	Fault-tolerant computer systems Spanning tree Link protocols Network protocols Network topology Ethernet standards
gold:hypernym	Protocol
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Spanning_Tree_Protocol?oldid=1074500450&ns=0
Wikipage page ID	98761 (xsd:integer)
page length (characters) of wiki page	44394 (xsd:nonNegativeInteger)
Wikipage revision ID	1074500450 (xsd:integer)
has abstract	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 (802.1s) has since been incorporated into IEEE 802.1Q-2014. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Spanning_Tree_Protocol
is differentFrom of	Real Time Streaming Protocol
is Wikipage redirect of	802.1s BPDUs Spanning-tree Spanning tree protocol IEEE 802.1s 802.1s-2002 802.1w-2001 802.1w Bridge ID Rapid Spanning Tree Protocol Rapid spanning tree Spanning-tree protocol Spanning tree trotocol MaxAge Timer PVST IEEE 802.1w RPVST
is Link from a Wikipage to another Wikipage of	Flex links Flooding (computer networking) Flooding algorithm Local area network Loch Arbour, New Jersey 802.1s Arista Networks BID BPDUs Bridge protocol data unit Broad Band Broadcast storm Brocade Communications Systems Carrier Ethernet Distributed Overlay Virtual Ethernet History of computing Metro Ethernet Metro Ring Protocol Metropolitan area network Ocean Township High School Dell M1000e Dell Networking Operating System Link aggregation List of Internet pioneers List of Jewish American computer scientists List of information technology initialisms List of network protocols (OSI model) List of network theory topics List of pioneers in computer science CobraNet Collection (abstract data type) Computer network Dynamic routing High-availability Seamless Redundancy List of computer scientists Data link layer IEEE 802.1 IEEE 802.11c IEEE 802.1D IEEE 802.1Q IEEE 802.1ad

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (82 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software