Visualizing network topologies with the help of the Spanning Tree Protocol (STP)

Supervisor(s)Dr. Pascal Schöttle


The Spanning Tree Protocol (STP) is a network protocol that ensures a loop-free topology in an bridged Ethernet LAN. It creates a spanning tree within a network of connected layer-2 bridges and was specified and extended in several IEEE standards.

The goal of this thesis is to capture STP pakets in several locations within a network, combine them to an as accurate as possible overall network topology and to visualize this network topology in an abstract data format. If it is helpful, information about Shortest Path Bridging (SPB), also standardized by the IEEE, should be incorporated.


  • Perlman, R. An Algorithm for Distributed Computation of a Spanningtree in an Extended LAN. ACM SIGCOMM Computer Communication Review, 15, 4 (September 1985), 44–53.
  • Luo, Z. and Suh, C. An Improved Shortest Path Bridging Protocol for Ethernet Backbone Network. In International Conference on Information Networking (ICOIN). 2011, pp. 148–153.