- Spanning tree protocol
The Spanning Tree Protocol is an OSI layer-2 protocol that ensures a loop-free topology for any bridged LAN. It is based on an
algorithminvented by Radia Perlmanwhile working for Digital Equipment Corporationcite journal|last=Perlman|first=Radia|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|date=1985|doi=10.1145/318951.319004] [cite book
last = Perlman
first = Radia
authorlink = | coauthors =
year = 2000
title = Interconnections, Second Edition
publisher = Addison-Wesley
location = USA
id = ISBN 0-201-63448-1] . Spanning tree allows a network design to include spare (redundant) links to provide automatic backup paths if an active link fails, without the danger of bridge loops, or the need for manual enabling/disabling of these backup links. Bridge loops must be avoided because they result in flooding the network.
The Spanning Tree Protocol (STP), is defined in the
IEEEStandard 802.1D. As the name suggests, it creates a spanning tree within a mesh networkof connected layer-2 bridges (typically Ethernetswitches), and disables those links that are not part of the tree, leaving a single active path between any two network nodes.
The collection of bridges in a LAN can be considered a graph whose nodes are the bridgesand whose edges are the cables connecting the bridges. To break loops in the LAN while maintaining access to all LAN segments,the bridges collectively compute a spanning tree. The spanning tree is not necessarily a minimum cost spanning tree. A network administrator can reduce the cost of a spanning tree, if necessary, by altering some of the configuration parameters in such a way as to affect the choice of the root of the spanning tree.
The spanning tree that the bridges compute using the Spanning Tree Protocol can be determined using the following rules. The example network at the right, below, will be used to illustrate the rules.
Elect a root bridge. The "root bridge" of the spanning tree is the bridge with the smallest bridge ID. Each bridge has a unique identifier (ID) and a configurable priority number; the bridge ID contains both numbers. To compare two bridge IDs, the priority is compared first. If two bridges have equal priority, then the MAC addresses are compared. For example, if switches A (MAC=0000.0000.1111) and B (MAC=0000.0000.2222) both have a priority of 10, then switch A will be elected as the root bridge. If the network administrator would like switch B to become the root bridge, he must set its priority to be less than 10. (The default priority of
Ciscoswitches is 32768 ).
Determine the least cost paths to the root bridge. The computed spanning tree has the property that messages from any connected device to the root bridge traverse a least cost path, i.e., a path from the device to the root that has minimum cost among all paths from the device to the root. The cost of traversing a single network segment is configurable; the cost of traversing a path is the sum of the costs of the segments on the path. Different technologies have different default costs for network segments. Also, an administrator can configure the cost of traversing a particular network segment.
The property that messages always traverse least-cost paths to the root is guaranteed by the following two rules.
"Least cost path from each bridge." After the root bridge has been chosen, each bridge determines the cost of each possible path from itself to the root. From these, it picks the one with the smallest cost (the least-cost path). The port connecting to that path becomes the "root port" of the bridge.
"Least cost path from each network segment." The bridges on a network segment collectively determine which bridge has the least-cost path from the network segment to the root. The port connecting this bridge to the network segment is then the "designated port" for the segment.
Disable all other root paths. Any active port that is not a root port or a designated port is a blocked port.
Modifications in case of ties. The above rules over-simplify the situation slightly, because it is possible that there are ties, for example, two or more ports on a single bridge are attached to least-cost paths to the root or two or more bridgeson the same network segment have equal least-cost paths to the root. To break such ties:
"Breaking ties for root ports." When multiple paths from a bridge are least-cost paths, the chosen path uses the neighbor bridge with the lower bridge ID. The root port is thus the one connecting to the bridge with the lowest bridge ID. For example, in figure 3, if switch 4 were connected to network segment e, there would be two paths of length 2 to the root, one path going through bridge 24 and the other through bridge 92. Because there are two least cost paths, the lower bridge ID (24) would be used as the tie-breaker in choosing which path to use.
"Breaking ties for designated ports." When more than one bridge on a segment leads to a least-cost path to the root, the bridge with the lower bridge ID is used to forward messages to the root. The port attaching that bridge to the network segment is the "designated port" for the segment. In figure 4, there are two least cost paths from network segment d to the root, one going through bridge 24 and the other through bridge 92. The lower bridge ID is 24, so the tie breaker dictates that the designated port is the port through which network segment is connected to bridge 24.
"The final tie-breaker." In some cases, there may still be a tie, as when two bridges are connected by multiple cables. In this case, multiple ports on a single bridge are candidates for root port or designated port. In this case, the port with the lowest port priority is used.
Data rate and STP path cost
Bridge Protocol Data Units (BPDUs)
The above rules describe one way of determining what spanning tree will be computed by the algorithm, but the rules as written imply knowledge of the entire network. The bridges have to determine the root bridge and compute the port roles (root, designated, or blocked) with only the information that they have. To ensure that each bridge has enough information, the bridges use special data frames called Bridge Protocol Data Units (BPDUs) to exchange information about bridge IDs and root path costs.
There are three types of BPDUs:
* Configuration BPDU (CBPDU), used for Spanning Tree computation
* Topology Change Notification (TCN) BPDU, used to announce changes in the network topology
* Topology Change Notification Acknowledgment (TCA)
BPDUs are exchanged regularly (every 2 seconds by default) and enable switches to keep track of network changes and to start and stop forwarding at ports as required.
When a device is first attached to a switch port, it will not immediately start to forward data. It will instead go through a number of states while it processes BPDUs and determines the topology of the network. When a host is attached such as a computer, printer or server the port will always go into the forwarding state, albeit after a delay of about 30 seconds while it goes through the listening and learning states (see below). The time spent in the listening and learning states is determined by a value known as the forward delay (default 15 seconds and set by the root bridge). However, if instead another "switch" is connected, the port may remain in blocking mode if it is determined that it would cause a loop in the network. Topology Change Notification (TCN) BPDUs are used to inform other switches of port changes. TCNs are injected into the network by a non-root switch and propagated to the root. Upon receipt of the TCN, the root switch will set a Topology Change flag in its normal BPDUs. This flag is propagated to all other switches to instruct them to rapidly age out their forwarding table entries.
STP switch port states:
*Blocking - A port that would cause a switching loop, no user data is sent or received but it may go into forwarding mode if the other links in use were to fail and the spanning tree algorithm determines the port may transition to the forwarding state. BPDU data is still received in blocking state.
*Listening - The switch processes BPDUs and awaits possible new information that would cause it to return to the blocking state.
*Learning - While the port does not yet forward frames (packets) it does learn source addresses from frames received and adds them to the filtering database (switching database)
*Forwarding - A port receiving and sending data, normal operation. STP still monitors incoming BPDUs that would indicate it should return to the blocking state to prevent a loop.
*Disabled - Not strictly part of STP, a network administrator can manually disable a port
To prevent the delay when connecting hosts to a switch and during some topology changes, Rapid STP was developed and standardized by IEEE 802.1w, which allows a switch port to rapidly transition into the forwarding state during these situations.
The bridge ID, or BID, is a field inside a
BPDUpacket. It is eight bytes in length. The first two bytes are the Bridge Priority, an unsigned integer of 0-65,535. The last six bytes are a MAC addresssupplied by the switch. In the event that MAC AddressReduction is used, the first two bytes are used differently. The first four bits are a configurable priority, and the last twelve bits carry either the VLANID or MSTP instance number.
Evolutions and extensions
The first spanning tree protocol was invented in 1985 at the Digital Equipment Corporation by
Radia Perlman. In 1990, the IEEE published the first standard for the protocol as 802.1D [Citation|editor-last=LAN/MAN Standards Committee of the IEEE Computer Society|title=ANSI/IEEE Std 802.1D|date=1990|publisher=IEEE] , based on the algorithm designed by Perlman. Subsequentversions were published in 1998 [Citation|editor-last=LAN/MAN Standards Committee of the IEEE Computer Society|title=ANSI/IEEE Std 802.1D, 1998 Edition, Part 3: Media Access Control (MAC) Bridges|date=1998|publisher=IEEE] and 2004Citation|editor-last=LAN/MAN Standards Committee of the IEEE Computer Society|title=ANSI/IEEE Std 802.1D - 2004: IEEE Standard for Local and Metropolitan Area Networks: Media Access Control (MAC) Bridges|date=2004|publisher=IEEE] , incorporating various extensions.
Although the purpose of a standard is to promote interworking of equipment from different vendors, different implementations of a standard are not guaranteed to work, due for example to differences in default timer settings. The IEEE encourages vendors to provide a "Protocol Implementation Conformance Statement," declaring which capabilities and options have been implemented, to help users determine whether different implementations will interwork correctly.
Also, the original Perlman-inspired Spanning Tree Protocol, called DEC STP, is not a standard and differs from the IEEE version in message format as well as timer settings. Some bridges implement both the IEEE and the DEC versions of the Spanning Tree Protocol, but their interworking can create issues for the network administrator, as illustrated by the problem discussed in an on-line Cisco document [Citation|publisher=Cisco Systems, Inc.|title=Understanding Issues Related to Inter-VLAN Bridging|id=11072|url=http://www.cisco.com/warp/public/473/inter-vlan_11072.pdf] .
Rapid Spanning Tree Protocol (RSTP)
In 1998, the
IEEEwith document 802.1w introduced an evolution of the Spanning Tree Protocol: Rapid Spanning Tree Protocol (RSTP), which provides for faster spanning tree convergence after a topology change. Standard IEEE 802.1D-2004 now incorporates RSTP and obsoletes STP. While STP can take 30 to 50 seconds to respond to a topology change, RSTP is typically able to respond to changes within a second. [cite web|url = http://www.compactpci-systems.com/articles/id/?203 |title = Rapid Spanning Tree Protocol: A new solution from an old technology |accessdate = 2008-08-04 |date = March 2003[ CPCI203 ]|author = Waldemar Wojdak] [cite web|url = http://www.cisco.com/warp/public/473/146.html |title = CCO Redirect |accessdate = 2008-08-04]
RSTP bridge port roles:
*Root - A forwarding port that has been elected for the spanning-tree topology
*Designated - A forwarding port for every LAN segment
*Alternate - An alternate path to the root bridge. This path is different than using the root port.
*Backup - A backup/redundant path to a segment where another bridge port already connects.
*Disabled - Not strictly part of STP, a network administrator can manually disable a port
RSTP is a refinement of STP and therefore shares most of its basic operation characteristics. However there are some notable differences as summarized below:
* Detection of root switch failure is done in 3 hello times, which is 6 seconds if default hello times have not been changed.
* Ports may be configured as edge ports if they are attached to a LAN that has no other bridges attached. These edge ports transition directly to the forwarding state. RSTP still continues to monitor the port for BPDUs in case a bridge is connected. RSTP can also be configured to automatically detect edge ports. As soon as the bridge detects a BPDU coming to an edge port, the port becomes a non-edge port.
* Unlike in STP, RSTP will respond to BPDUs sent from the direction of the root bridge. An RSTP bridge will "propose" to its designated ports its spanning tree information. If another RSTP bridge receives this information, determines this is the superior root information, and sets all its other ports to discarding. The bridge may send an "agreement" to the first bridge confirming its superior spanning tree information. The first bridge, upon receiving this agreement, knows it can rapidly transition that port to the forwarding state bypassing the traditional listening/learning state transition. This essentially creates a cascading effect away from the root bridge where each designated bridge proposes to its neighbors to determine if it can make a rapid transition. This is one of the major elements that allows RSTP to achieve faster convergence times than STP.
* As discussed in the port role details above, RSTP maintains backup details regarding the discarding status of ports. This avoids timeouts if the current forwarding ports were to fail or BPDUs were not received on the root port in a certain interval.
Per-VLAN Spanning Tree (PVST)
Ethernetswitched environments where multiple Virtual LANs exist, spanning tree can be deployed per Virtual LAN.
Cisco's name for this is "per VLAN spanning tree" (
PVSTand PVST+, which is the default protocol used by Cisco switches).Both PVST and PVST+ protocols are Cisco proprietary protocols and they cannot be used on 3rd party switches, although Extreme Networks support PVST+ with two limitations (lack of support on ports where the VLAN is untagged/native and also on the VLAN with ID 1).PVST works only with ISL (Cisco's proprietary protocol for VLANencapsulation) due to its embedded Spanning tree ID. Due to high penetration of the IEEE 802.1Q VLANtrunking standard and PVST's dependence on ISL, Cisco defined a different PVST+ standard for 802.1Q encapsulation. PVST+ can tunnel across a MSTP Region.
Multiple Spanning Tree Protocol (MSTP)
The "Multiple Spanning Tree Protocol" (MSTP), originally defined in
IEEE 802.1sand later merged into IEEE 802.1Q-2003, defines an extension to the RSTP protocol to further develop the usefulness of virtual LANs (VLANs). This "Per-VLAN" Multiple Spanning Tree Protocol configures a separate Spanning Tree for each VLAN group and blocks the links that are redundant within each Spanning Tree.
If there is only one
Virtual LAN( VLAN) in the network, single (traditional) STP works appropriately. If the network contains more than one VLAN, the logical network configured by single STP would work, but it is possible to make better use of the redundant links available by using an alternate spanning tree for different (groups of) VLANs.
MSTP allows formation of MST regions that can run multiple MST instances (MSTI). Multiple regions and other STP bridges are interconnected using one single common spanning tree (CST).
MSTP was inspired by
Cisco Systems' Multiple Instances Spanning Tree Protocol (MISTP), and is an evolution of the Spanning Tree Protocoland the Rapid Spanning Tree Protocol. It was introduced in IEEE 802.1sas amendment to 802.1Q, 1998 edition. Standard IEEE 802.1Q-2003 now includes MSTP.
Unlike some proprietary per-VLAN spanning tree implementations,Fact|date=May 2007 MSTP includes all of its spanning tree information in a single BPDU format. Not only does this reduce the number of BPDUs required on a LAN to communicate spanning tree information for each VLAN, but it also ensures backward compatibility with RSTP (and in effect, classic STP too). MSTP does this by encoding additional region information after the standard RSTP BPDU as well as a number of MSTI messages (from 0 to 64 instances, although in practice many bridges support less). Each of these MSTI configuration messages conveys the spanning tree information for each instance. Each instance can be assigned a number of configured VLANs and frames (packets) assigned to these VLANs operate in this spanning tree instance whenever they are inside the MST region. In order to avoid conveying their entire VLAN to spanning tree mapping in each BPDU, bridges encode an MD5 digest of their VLAN to instance table in the MSTP BPDU. This digest is then used by other MSTP bridges, along with other administratively configured values, to determine if the neighboring bridge is in the same MST region as itself.
MSTP is fully compatible with RSTP bridges, in that an MSTP BPDU can be interpreted by an RSTP bridge as an RSTP BPDU. This not only allows compatibility with RSTP bridges without configuration changes, but also causes any RSTP bridges outside of an MSTP region to see the region as a single RSTP bridge, regardless of the number of MSTP bridges inside the region itself. In order to further facilitate this view of an MST region as a single RSTP bridge, the MSTP protocol uses a variable known as remaining hops as a time to live counter instead of the message age timer used by RSTP. The message age time is only incremented once when spanning tree information enters an MST region, and therefore RSTP bridges will see a region as only one "hop" in the spanning tree. Ports at the edge of an MST region connected to either an RSTP or STP bridge or an endpoint are known as boundary ports. As in RSTP, these ports can be configured as edge ports to facilitate rapid changes to the forwarding state when connected to endpoints.
Rapid Per-VLAN Spanning Tree (R-PVST)
Cisco's proprietary protocol that combines the functionalites of RSTP and PVST.It based on a per VLAN instance that creates a tree for each VLAN.
minimum spanning tree
distributed minimum spanning tree
* IEEE 802.1D
Ethernet Automatic Protection System
* [http://www.cisco.com/en/US/tech/tk389/tk621/tsd_technology_support_protocol_home.html Cisco's Introduction to Spanning-Tree]
* [http://research.sun.com/people/mybio.php?uid=28941 Radia Perlman at Sun Labs]
* [http://standards.ieee.org/getieee802/download/802.1D-2004.pdf ANSI/IEEE 802.1D-2004 standard]
* [http://www.hp.com/rnd/training/technical/MSTP.htm ProCurve Spanning Tree implementation Training]
* [http://www.loriotpro.com/Products/On-line_Documentation_V5/LoriotProDoc_EN/J10-Loriotpro_tools/J10-S19_STP_Bridge_EN.htm Spanning Tree Map from LoriotPro]
** RFC 2674-1999, proposed standard, Definitions of Managed Objects for Bridges with Traffic Classes, Multicast Filtering and Virtual LAN Extensions
** RFC 1525-1993, - SBRIDGEMIB, proposed standard, Definitions of Managed Objects for Source Routing Bridges
** RFC 1493-1993 - BRIDGEMIB, draft standard, Definitions of Managed Objects for Bridges
Wikimedia Foundation. 2010.
Look at other dictionaries:
Spanning Tree Protocol — сетевой протокол, работающий на втором уровне модели OSI. Основан на одноимённом алгоритме, разработчиком которого является «Мама Интернета» Радья Перлман (англ. Radia Perlman). Основной задачей STP является приведение сети Содержание 1 Принцип… … Википедия
Spanning Tree Protocol — Le Spanning Tree Protocol (aussi appelé STP) est un protocole réseau permettant une topologie réseau sans boucle dans les LAN avec pont. Il est défini dans la norme IEEE 802.1D. Sommaire 1 Mode de fonctionnement 1.1 Élection d un root br … Wikipédia en Français
Spanning Tree Protocol — Internet protocol suite Application layer BGP DHCP DNS FTP HTTP … Wikipedia
Spanning tree protocol — Détermination d un spanning tree Le Spanning Tree Protocol (aussi appelé STP) est un protocole réseau de niveau 2 permettant de déterminer une topologie réseau sans boucle (appelée arbre) dans les LAN avec ponts. Il est défini dans la norme IEEE… … Wikipédia en Français
Spanning Tree Protocol — STP (Spanning Tree Protocol) Familie: Inter Switch Kommunikation Einsatzgebiet: Management von logischen Ethernet Verbindungen STP im Protokollstapel: Netzzugang STP Ethernet Standards … Deutsch Wikipedia
spanning tree protocol — (STP) Transparent bridging protocol, usually for Ethernet to Ethernet … IT glossary of terms, acronyms and abbreviations
Rapid Spanning Tree Protocol — Saltar a navegación, búsqueda Rapid Spanning Tree Protocol (RSTP) es un protocolo de red de la segunda capa OSI, (nivel de enlace de datos), que gestiona enlaces redundantes. Especificado en IEEE 802.1w, es una evolución del Spanning tree… … Wikipedia Español
Rapid Spanning Tree Protocol — Das Rapid Spanning Tree Protocol (RSTP) ist ein Netzprotokoll, um redundante Pfade in lokalen Netzen zu deaktivieren, bzw. im Bedarfsfall (Ausfall einer Verbindung) wieder zu aktivieren. Es ist eine Weiterentwicklung des Spanning Tree Protocol… … Deutsch Wikipedia
Spanning Tree — protocol Le Spanning Tree Protocol (aussi appelé STP) est un protocole réseau permettant une topologie réseau sans boucle dans les LAN avec pont. Il est défini dans la norme IEEE 802.1D. Sommaire 1 Mode de fonctionnement 1.1 Élection d un root br … Wikipédia en Français
Spanning tree — (Spanning Tree Protocol) (SmmTPr) es un protocolo de red de nivel 2 de la capa OSI, (nivel de enlace de datos). Está basado en un algoritmo diseñado por Radia Perlman mientras trabajaba para DEC. Hay 2 versiones del STP: la original (DEC STP) y… … Wikipedia Español