LAN Bridge Spanning Tree Algorithm LAN Bridge Spanning Tree AlgorithmThe IEEE 802 committee has developed a series of algorithms for enabling bridges to be placed between LANs without the stations being aware of it. If the network formed has loops, the bridges run an election protocol to ensure that only sufficient bridges to form a spanning tree remain active. This project was to develop a system for specifying a configuration of LANs, simulating the operation of the spanning tree algorithm, and displaying the simulation in real-time using an interactive graphical environment.
The source code is released under the GNU General Public License (GPL). The user guide and javadoc online documentation are released under the GNU Free Documentation License.
The source code archive contains a .jar manifest and ant build file, when compiled it can be run as:
java -jar LBSTA.jar.
The icons used are from the GNOME project, some of them have been modified.
Content ©2008 Simon Arlott. Re-use permitted under a Creative Commons licence: Attribution-NonCommercial-NoDerivs 2.5.
Design ©2008 Simon Arlott.
Re-use permitted under a Creative Commons licence: Attribution-NonCommercial-ShareAlike 2.5.