LAN Bridge Spanning Tree Algorithm

The 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.

Notes

The icons used are from the GNOME project, some of them have been modified.


Wishlist
|
Blog
|
Numbers

Last modified 2013-06-01T08:35:49+00:00.
©2002-2018 Simon Arlott. All Rights Reserved.