spanning tree protocol

(redirected from Spanning-tree protocol)

spanning tree protocol

An algorithm that runs in network bridges and switches to prevent loops, in which packets keep going around in circles. In a small network with one or two switches, the spanning tree protocol (STP) has little value; however, in a large network where many switches are connected to each other via bridges, redundant paths can cause loops.

The algorithm creates a hierarchical "tree" that "spans" the entire network. It determines all redundant paths and makes only one of them active at any given time. In addition, if there are redundant paths and one of them fails, it allows the other to take over. The spanning tree protocol is part of the IEEE 802.1 network management standard. See IEEE 802 and BPDU.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
- Guarantee a certain level of redundancy in order to minimize packet loss with RSTP (Rapid Spanning-Tree Protocol) and ERPS (Ethernet Ring Protection Switch) rings
The labs provide practice on Cisco IOS Software configuration procedures, covering areas such as spanning-tree protocol, switch security, QoS, and intercampus networking with transparent LAN services.
Network service redundancy is achieved through ATM Simple Server Redundancy Protocol (SSRP), Hot Standby Router Protocol (HSRP) and support for Spanning-Tree Protocol on a per-VLAN basis.