Encyclopedia

spanning tree algorithm

Also found in: Acronyms.

spanning tree algorithm

An IEEE 802.1 standard under consideration which will provide distributed routing over multiple LANs connected by bridges.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

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-2025 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.
Mentioned in
References in periodicals archive
The LET-DG algorithm is a distributed implementation of the maximum spanning tree algorithm [21] on a weighted network graph with the edge weights modeled as the predicted link expiration time (LET) of the constituent end nodes.
Link expiration time and minimum distance spanning trees based distributed data gathering algorithms for wireless mobile sensor networks
end While return rd-MST ([V.sup.rd], [E.sup.rd]) End The run-time complexity of the rd-MST algorithm is O([absolute value of E] x log [[absolute value of E]) + O([absolute value of V] + [absolute value of E]) = O([absolute value of V] + [absolute value of E] x log [absolute value of E]), where O([absolute value of E] x log [absolute value of E]) is the run-time complexity of the Kruskal's minimum-weight spanning tree algorithm [8] and O([absolute value of V] + [absolute value of E]) is the run-time complexity of Breadth- First Search [8], both on a graph of [absolute value of V] vertices and [absolute value of E] edges.
Use of tree traversal algorithms for chain formation in the PEGASIS data gathering protocol for wireless sensor networks
Packets also improve the F-heap minimum spanning tree algorithm, giving the fastest algorithm currently known for this problem.
Abstracts from other ACM publications
Beginning with a discussion of networking standards and basic hardware and cabling, the work covers topics such as ethernet networking, spanning tree algorithms, IP protocols such as TCP, UDP and SCTP, address resolutions systems, routing, virtual local networks, IP on PPP connections, network administration, security and flow management.
Local networks and the Internet; from protocols to interconnection
Nonprojective Dependency Parsing Using Spanning Tree Algorithms. In Proceedings of the Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing.
Networks and natural language processing
Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.