answersLogoWhite

0


Best Answer

d. A broadcast storm

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What potential problem does stp spanning tree protocol address?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What problem does the Montreal protocol address?

Ozone depletion


What potential problem does STP address?

a broadcast storm Network + Guide To Networks Review Question Chapter 6 #10 WRONG ANSWER


Is 'potential problem' is a correct phrase?

Yes, the term means that something has the potential to become a problem. The word 'potential' can be a noun or an adjective. In this term, the word 'potential' is an adjective describing the noun 'problem'.


Should rich countries do anything about this potential problem?

Ahhh . . . exactly what potential problem?


Does every problem has solution?

Not necessarily. Some problems may not have a definitive solution, while others may have multiple potential solutions. It often depends on the complexity of the problem and the resources available to address it.


When a PC reports it has used an automatic private IP address what can you assume about the network?

You may assume that there is a problem with network connectivity somewhere. You might also assume that the DHCP server is not operating because an APIPA address would only be used if the device could not receive an address via DHCP protocol.


What is problem and solution?

Describes a problem and relays a potential solutions.


What is problem - solution?

Describes a problem and relays a potential solutions.


What is the importance of Hypertext Transfer Protocol Secure?

The importance of the Hypertext Transfer Protocol Secure is that it ensures that a given connection is secure. This helps minimize the problem that is associated with hacking.?æ


What was the original problem the gas mask was designed to address?

What was the original problem the gas mask was designed to address


How is looping problem solve by switches and by routers?

The looping problem solved by switches by using an algorithm named Spanning Tree algorithm and Routers by using Dijkstra's shortest path algorithm.Switches handle the looping problem through making spanning tree.Switches:Switching handle the looping problem by building Spanning Tree.Spanning Tree Algorithm:There are possibilities in the extended LANs having loop like structure. Bridges and switch must be able to correctly handle loops. This addressed by having the bridge or switch run a distributed Spanning Tree Algorithm.If you think of the extended LAN as being represented by a graph that has loops (cycles) then a spanning tree is a subgraph of this graph that covers (Spans) all the vertices, but contains no cycles. That is a spanning tree keeps all the vertices of the original graph, but throws out some of the edges.Consider the following extended LAN with many bridges or switch forms loops.If we remove some ports for the bridge or switch from the topology, the extended LAN reduced to a cyclic tree. The main idea of the spanning tree is for the bridge or switch to select the ports over which they will forward frame. The algorithm selects ports as follows.The spanning tree algorithm first selects the bridge with smallest id as the root of the spanning tree as described below.The root bridge or switch always forwards frames out over all of its ports.Each bridge computes the shortest path to the root and records the corresponding port. This port is also selected as the bridge or switch preferred path to the root.All the bridge or switch connected to a given LAN elect a single designated bridge that will be responsible for forwarding frames towards the root bridge.Routers:Routers rely on routing protocols to build shortest path to avoid routing loops. (Ex) Link State Routing protocol and Distance Vector Routing protocol.Link State Routing protocol build routing table based on Dijkstra's algorithm and Distance Vector Routing protocol build routing table based on Bellman Ford algorithm.The local node may be the start (root) of the tree.The local node has cost 0 and makes itself as permanent node.From the list of tentative nodes -Find a node with lower cumulative cost and make it as permanent.Select the direction with the shortest cumulative cost.To examine each neighbor node of it that was the last permanent node.Repeat the steps until every node becomes permanent.


What were the goals of Martin Luther King jrs poor people's campaign that he was leading when he was assassinated?

to pressure the nation to address the problem of poverty