The interdependence of communication networks and electrical power grids is a topic of discussion in recent times. Though researchers try to map the interdependence, there are no topology-level frameworks that have data on both communication networks and electrical power grids. This work aims to generate such topology-level frameworks to publish as open-source to encourage research along this direction.

Voraussetzungen

A cut set of a flow is a set of components when removed, cause the flow to fail. A cut set is minimal if it cannot be further reduced. Based on minimal cut sets for flows, this work aims to investigate a potential centrality metric to determine the importance of particular nodes in the network. 

Voraussetzungen

Robustness Surfaces are visual tools to understand the resilience of networks in the event of failures. This thesis aims to develop a tool to generate robustness surfaces to quantitatively measure the robustness of networks.

References:

[1] Rueda, Diego F., Eusebi Calle, and Jose L. Marzo. "Robustness comparison of 15 real telecommunication networks: Structural and centrality measurements." Journal of Network and Systems Management 25 (2017): 269-289.

[2]Manzano, Marc, et al. "Robustness surfaces of complex networks." Scientific reports 4.1 (2014): 6133.

Voraussetzungen

Currently, we have developed two tools for Reliability Block Diagram Evaluation, one tool for Robustness Surface generation, and one script to generate minimal cut sets for flows. From the sovereignty perspective, we have the three metrics, (i) Path set diversity score, (ii) Cut set coloring score, (iii) Cut set diversity score. In this work, we consolidate all these dependability oriented works into a unified demo packaged in a GUI, aimed to be a part of our future demos. The role of the student is to build the GUI from scratch and integrate the previous individual tools, develop new scripts to generate fault trees, make adequate plots, and add necessary features to suit the demo-GUI.

Voraussetzungen

A cut set of a flow is a set of components that, when failed, cause the flow to fail. A cut set is minimal when it cannot be further reduced. A robust flow must have a few minimal cut sets and very large minimal cut sets. In this work, we try to estimate the maximum size of the minimal cut set for a flow. We use the Min-Cut Max-Flow theorem as the basis to investigate the maximum size of the minimal cut set.

Voraussetzungen