spanning tree protocol - définition. Qu'est-ce que spanning tree protocol
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est spanning tree protocol - définition


Spanning Tree Protocol         
NETWORK PROTOCOL THAT BUILDS A LOOP-FREE LOGICAL TOPOLOGY FOR ETHERNET NETWORKS
Spanning-tree protocol; BPDUs; Rapid Spanning Tree Protocol; 802.1w; Spanning tree trotocol; Rapid spanning tree; Bridge ID; IEEE 802.1s; 802.1s; MaxAge Timer; 802.1w-2001; 802.1s-2002; Spanning tree protocol; IEEE 802.1w; PVST; Spanning-tree; RPVST
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.
Multiple Spanning Tree Protocol         
  • Two-layer network proposal for ABridges.
  • CIST operates links between regions and to SST devices.
  • Different Spanning trees created by different MSTIs on the same physical layout.
  • Simple network topology for MSTP trials.
  • MSTIs in different regions.
NETWORK PROTOCOL THAT BUILDS A LOOP-FREE LOGICAL TOPOLOGY FOR ETHERNET NETWORKS
Multiple Spanning Tree protocol; Common Spanning Tree; MISTP
The Multiple Spanning Tree Protocol (MSTP) and algorithm, provides both simple and full connectivity assigned to any given Virtual LAN (VLAN) throughout a Bridged Local Area Network. MSTP uses BPDUs to exchange information between spanning-tree compatible devices, to prevent loops in each MSTI (Multiple Spanning Tree Instances) and in the CIST (Common and Internal Spanning Tree), by selecting active and blocked paths.
spanning tree algorithm         
  • T}}.
  • This figure shows there may be more than one minimum spanning tree in a graph. In the figure, the two trees below the graph are two possibilities of minimum spanning tree of the given graph.
DATA STRUCTURE, SUBGRAPH OF A WEIGHTED GRAPH
Spanning tree algorithm; Minimal spanning tree; Shortest spanning tree; Minimum spanning forest; Minimum weight spanning tree; Minimum weight spanning forest; Minimum cost spanning tree; Minimum Spanning Tree; Minimum spanning tree problem; Spanning tree problem; Minimum k-node-connected spanning network problem; Minimum k-edge-connected spanning network problem; Minimum Weight Spanning Tree; Minimum spanning trees; Min spanning tree; Parallel algorithms for the minimum spanning tree problem; Algorithms for finding minimum spanning trees; Applications of the minimum spanning tree problem; Applications of minimum spanning trees
An IEEE 802.1 standard under consideration which will provide distributed routing over multiple LANs connected by bridges.