Optimized spanning tree construction based on parameter selection

1. A method, comprising:

providing a parameter of a bridged packet-switched network;

correlating the parameter to an algorithm if the parameter is selected; and

constructing an optimized spanning tree if the parameter is correlated to the algorithm, the optimized spanning tree to improve a performance of the network with respect to the selected parameter.

2. The method of claim 1 , wherein the parameter relates to at least one of aggregate link bandwidth utilization, a length of a forwarding path, a bandwidth at a node and a maintainability of an active topology of the network with a disturbance.

3. The method of claim 2 , wherein the algorithm relates to at least one of minimizing communication between nodes, setting a maximum length of a path from at least one of the nodes, setting a maximum bandwidth through at least one of the nodes, and allocating bandwidth between a plurality of the nodes.

4. The method of claim 3 , wherein,

the correlated algorithm is to vary a structure of the optimized spanning tree based on a value entered for the selected parameter, and

the correlated algorithm sets a priority of at least one of the nodes of the optimized spanning tree.

5. The method of claim 1 , further comprising:

modifying a current spanning tree constructed for the network based on the optimized spanning tree, wherein

the modifying includes reassigning the priority of at least one of the nodes based on a difference between the current spanning tree and the optimized spanning tree.

6. The method of claim 1 , further comprising:

collecting topological information about at least one of the nodes of the network, wherein

the information relates to at least one of a physical and an active topology of the network.

7. The method of claim 6 , further comprising:

organizing the collected topological information into a database format; and

updating a database with the organized topological information, wherein

the constructing constructs the optimized spanning tree based on the database.

8. The method of claim 1 , wherein

the correlating comprises correlating the parameter to one of a plurality of stored algorithms if the parameter is selected, each of the plurality of stored algorithms to construct a respective one of a plurality of optimized spanning trees, wherein

the constructing comprises constructing one of the plurality of optimized spanning trees if the parameter is correlated to the one of the plurality of stored algorithms.

9. The method of claim 1 , farther comprising outputting a current spanning tree constructed for the network and optimized spanning tree to the user to allow a user to compare the current spanning tree and the optimized spanning tree.

10. A network management system, comprising:

circuitry to:

provide one or more parameters related to a performance of a bridged packet-switched network to a user interface for selection;

select at least one of a plurality of stored algorithms based on the selected one or more parameters, each of the plurality of stored algorithms to construct a respective one of a plurality of optimized spanning trees;

construct one or more of the optimized spanning trees based on the one or more parameters selected at the user interface, each of the one or more optimized spanning trees optimized according to at least one of the one or more parameters;

determine a priority of a node of the one or more optimized spanning trees based on the one or more selected parameters.

11. The system of claim 10 , further comprising:

the circuitry to collect information related to at least one of a physical and an active topology of the network, wherein

the circuitry is to communicate with at least one of the nodes to collect the information.

12. The system of claim 11 , further comprising:

the circuitry to organize the collected information into a format; and

a database to store the organized information.

13. The system of claim 12 ,

wherein the circuitry is to output the one or more optimized spanning trees to a display based on the at least one selected algorithm and the organized information, and

the database is to store the plurality of algorithms.

14. The system of claim 10 , wherein,

at least one of the nodes of the one or more optimized spanning trees corresponds to a bridge,

at least one edge of the one or more optimized spanning trees corresponds to a link connecting to at least one of the bridges, and

the network is a mesh network and the bridge is a Layer 2 switch.

15. The system of claim 10 , wherein the circuitry is to output a current spanning tree constructed for the network and the one or more optimized spanning trees to the user to allow a user to compare the current spanning tree and the one or more optimized spanning trees.

16. A non-transitory computer-readable storage medium storing instructions that, if executed by a processor of a device, cause the processor to:

collect topological information about a bridged packet-switched network;

correlate a selected parameter related to a performance of the network to an algorithm; and

construct an optimized spanning tree based on the parameter and topological information, a priority of a node of the optimized spanning tree based on the correlated algorithm; and

output the optimized spanning tree to a user.

17. The non-transitory computer-readable storage medium of claim 16 , further comprising instructions that, if executed by the processor, cause the processor to:

provide a plurality of parameters of a bridged packet-switched network to the user for selection, one of the plurality of parameters selected by the user to be the selected parameter.

18. The non-transitory computer-readable storage medium of claim 17 , wherein,

the parameter relates to at least one of aggregate link bandwidth utilization, a length of a forwarding path, a bandwidth at a node and a maintainability of an active topology of the network with a disturbance, and

the algorithm relates to at least one of minimizing communication between nodes, setting a maximum length of a path from at least one of the nodes, setting a maximum bandwidth through at least one of the nodes, and allocating bandwidth between a plurality of the nodes.

19. The non-transitory computer-readable storage medium of claim 16 , wherein

the correlating comprises correlating the selected parameter to one of a plurality of stored algorithms, each of the plurality of stored algorithms to construct a respective one of a plurality of optimized spanning trees, wherein

the constructing comprises constructing one of the plurality of optimized spanning trees based on the parameter and topological information.

20. The non-transitory computer-readable storage medium of claim 16 , wherein outputting the optimized spanning tree to a user comprises outputting a current spanning tree constructed for the network and the one or more optimized spanning trees to the user to allow a user to compare the current spanning tree and the one or more optimized spanning trees.