Model-Based Generation of Service Provider Network Topologies

Christen, Pascal and Ribi, Lukas (2023) Model-Based Generation of Service Provider Network Topologies. Other thesis, OST Ostschweizer Fachhochschule.

[thumbnail of FS 2023-BA-EP-Christen-Ribi-Model-Based Generation of Service Provider Network Topologie.pdf] Text
FS 2023-BA-EP-Christen-Ribi-Model-Based Generation of Service Provider Network Topologie.pdf - Supplemental Material

Download (13MB)

Abstract

Objective:
Researchers and network engineers working for service providers need to validate network technologies to see how they scale on networks of varying sizes. Currently, these test networks are often created based on random graphs. Due to their randomness, they often lack characteristics found in real service provider network. The goal was to develop an approach to generate network topologies with specific characteristics of these service provider networks. Furthermore, the existing Graph Analyzer system created during the previous term project had to be expanded to include edge weights in graph property calculations. In addition, a new graph property indicating robustness needed to be implemented.

Approach:
The MOST-Model (Mesh-Oriented Service Provider Topology) has been developed to facilitate the generation of network topologies that structurally resemble service provider networks. The model consists of eight steps and is parameterised to provide flexibility in the generation process. The model is inspired by existing methodologies and uses approaches that lead to characteristics matching service provider networks. A Gabriel graph is used to create the topology with additional optimisations to ensure redundancy. In other published papers, it has been documented that this type of graph reflects backbone networks well. The newly created Graph Generator application uses the MOST-Model to generate topologies. An API provides the ability to interact with it. The Frontend of the Graph Analyzer system has been extended to integrate the Graph Generator. It allows the seamless generation and visualisation of topologies using adjustable model parameters. The generated result can subsequently be imported into the Graph Analyzer system. Graph property calculations have been extended by incorporating edge weights from imported topology data. An approach using a targeted attack on high-degree nodes was chosen to calculate the robustness of a graph.

Conclusion:
During the bachelor's thesis, the MOST-Model was developed to generate network topologies with service provider network characteristics. Due to the underlying use of the Gabriel graph, the number of edges is minimised while still providing redundancy through alternative paths. This property reflects service provider network requirements from a cost and availability perspective. Known issues of the Gabriel graph, such as stub links, are mitigated through applied optimisations. The model has been integrated into the Graph Analyzer system as a separate application. This separation allows the straightforward integration of the MOST-Model via the Graph Generator application into other systems and contexts. In addition, the results can be imported into other applications by providing the generated topologies in the commonly used GEXF and GraphML file formats. The resulting Graph Analyzer system provides an easy way to examine how networks are structured and can generate new topologies through the Graph Generator application. The source code is publicly available and published under the permissive MIT license.

Item Type: Thesis (Other)
Subjects: Technologies > Programming Languages > Python
Technologies > Network
Technologies > Programming Languages > Go
Technologies > Frameworks and Libraries > React
Divisions: Bachelor of Science FHO in Informatik > Bachelor Thesis
Depositing User: OST Deposit User
Contributors:
Contribution
Name
Email
Thesis advisor
Metzger, Laurent
UNSPECIFIED
Date Deposited: 21 Oct 2023 12:12
Last Modified: 21 Oct 2023 12:12
URI: https://eprints.ost.ch/id/eprint/1147

Actions (login required)

View Item
View Item