| |
Distributed Spanning Tree Algorithm
Title: Distributed Spanning Tree Algorithm
Category: Science & Technology
Details: Words: 499 | Pages: 2.1 (approximately 235 words/page)
Distributed Spanning Tree Algorithm
The Distributed Spanning Tree Algorithm (DSTA from now on…) is used to make sure that you don’t get a loop when you set up your network in a loop form, if that makes any sense. Okay, when you set up a network you want it to be reliable, and setting it up in a loop form allows it to have multiple routes to get to each separate computer (node of the tree). But you …showed first 75 words of 499 total…
You are viewing only a small portion of the paper.
Please login or register to access the full copy.
|
|
…showed last 75 words of 499 total…any other ports that were supposed to go from active to inactive have actually been able to finish doing that. If it doesn’t do this, there is a chance that a loop may be formed, which is something that is very unwanted. In all, the Spanning Tree is made up of all the bridges and their active ports that have been marked as active and the segments of wire that are connecting them together.
Need a custom written paper?
|
|
|
