SOFTWARE
-
Spanning Tree Simulator (STS)
STS is a command-line simulator written in C++ that allows the simulation of spanning tree algorithms. It supports the following spanning tree algorithms: Add, Prim, Kruskal, Wong, Campos, and the spanning tree algorithm used in IEEE 802.1D bridges. Its main purpose is to allow the comparison of such different spanning tree algorithms in terms of routing cost and execution time.
Currently, input parameters are mostly specified directly in the source code. This means that for each different simulation setting you need to recompile the program before running the simulation; this will be modified in the next version of the simulator. STS receives three major input parameters: the maximum number of vertices, the number of simulations runs, and the name of the file where the user wants to have the simulation results written. The results are written in the traditional format, i.e., in different columns separated by spaces. This allows easy export to standard programs, such as MS Excel, Matlab, Gnuplot, etc.
If you are interested in using the STS simulator, feel free to download it now. The .tar.gz file you download contains a wide set of simulations results. These results were obtained during simulations we have performed while comparing the multiple spanning tree algorithms supported by the simulator for different input random graphs. If you have some problem/doubt feel free to contact me. Instructions on how to compile and run the simulator are included in the companion README file.