<p>In this thesis an approach to visualize internal behaviour of object oriented software is developed.</p><p>The runtime information, which can be described as objects calling other objects, is displayed as a graph consisting of nodes and edges. The aim is to design an application in Java, which takes the runtime information in form of an object call graph and visualizes it as a tree and as a force directed view.</p><p>Therefore, first a data model has to be designed, holding an object call sequence. Furthermore, a discussion about graph definition languages and according tools is made. After this different graph layout algorithms are examined as well as graph displaying tools. Finally, the implementation of this visualization program deals with the combination of these three components graph data extraction, graph layout calculation and graph visualization.</p>

In this thesis an approach to visualize internal behaviour of object oriented software is developed. The runtime information, which can be described as objects calling other objects, is displayed as a graph consisting of nodes and edges. The aim is to design an application in Java, which takes the runtime information in form of an object call graph and visualizes it as a tree and as a force directed view. Therefore, first a data model has to be designed, holding an object call sequence. Furthermore, a discussion about graph definition languages and according tools is made. After this different graph layout algorithms are examined as well as graph displaying tools. Finally, the implementation of this visualization program deals with the combination of these three components graph data extraction, graph layout calculation and graph visualization.

Diss. : Philosophich-historische Fakultät : Bern : 1983. Tiré à part de : "Der Geschichtsfreund", vol. 137, 1984. Bibliogr. p. 300-317. Index. -

abstract: In traditional networks the control and data plane are highly coupled, hindering development. With Software Defined Networking (SDN), the two planes are separated, allowing innovations on either one independently of the other. Here, the control plane is formed by the applications that specify an organization's policy and the data plane contains the forwarding logic. The application sends all commands to an SDN controller which then performs the requested action on behalf of the application. Generally, the requested action is a modification to the flow tables, present in the switches, to reflect a change in the organization's policy. There are a number of ways to control the network using the SDN principles, but the most widely used approach is OpenFlow. With the applications now having direct access to the flow table entries, it is easy to have inconsistencies arise in the flow table rules. Since the flow rules are structured similar to firewall rules, the research done in analyzing and identifying firewall rule conflicts can be adapted to work with OpenFlow rules. The main work of this thesis is to implement flow conflict detection logic in OpenDaylight and inspect the applicability of techniques in visualizing the conflicts. A hierarchical edge-bundling technique coupled with a Reingold-Tilford tree is employed to present the relationship between the conflicting rules. Additionally, a table-driven approach is also implemented to display the details of each flow. Both types of visualization are then tested for correctness by providing them with flows which are known to have conflicts. The conflicts were identified properly and displayed by the views. / Dissertation/Thesis / Masters Thesis Computer Science 2016

This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.