The spanning tree protocol is part of the IEEE 802.1 network management standard. See IEEE 802 and BPDU. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction requires permission.

Spanning tree protocol is an essential function of Ethernet networks, and it provides several useful capabilities when used properly.

The spanning tree algorithm is used with Ethernet switches to routinely remove loop circuits. If these loops weren’t removed, a single IP packet carrying video could loop endlessly while consuming ...

Based on an algorithm created by American computer scientist Radia Perlman while she was working for Digital Equipment Corporation (DEC) in 1985, the primary purpose of Spanning Tree is to prevent ...

Inventor: Radia Perlman Invention: Spanning-tree algorithm — 1983 The story: The spanning-tree algorithm, used by all bridges and switches to route traffic from one point to another, is credited ...

You use an algorithm called the spanning tree protocol — just one of the contributions to computer science of a remarkable engineer, Dr. Radia Perlman.

We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. It is known that the GMST problem belongs ...

Spanning Tree Protocol is the tried and tested method for providing path redundancy while eliminating loops in bridged networks.

Layer 2 Spanning Tree Protocol STP, first introduced as a proprietary protocol in 1985 by Digital Equipment Corporation, has a simple requirement: Keep LANs loop free. In the absence of a control ...