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 can’t allow it to use all of the nodes at once because if it completes the loop (the information gets back to the computer that sent it) there can be an error. What the DSTA does is find out the shortest path that will reach to every computer and mark that as the root path. That path will remain open and then the DSTA finds the shortest paths from the root path to al
. . .
Some common words found in the essay are:
Algorithm DSTA, Spanning Tree, port configuration, configuration bridge, configuration port, root path, configuration port configuration, port configuration port, spanning tree, non-root ports, set network, loop form, dsta shortest, port port,
Approximate Word count = 492
Approximate Pages = 2 (250 words per page double spaced)
|
