Untitled

Funder

Organizational Unit

Publications

Interdependence between power grids and communication networks: a resilience perspective

Publication . Martins, Lúcia; Girão-Silva, Rita; Jorge, Luisa; Gomes, Álvaro; Musumeci, Francesco; Rak, Jacek

Power network resilience is increasingly dependent on communication networks. Besides traditional generation, power networks need to accommodate increasingly high penetration levels of dispersed micro generation, mostly based on renewable sources, and increasing and challenging demand, such as electric vehicles. At the same time the deployment of enabling technologies throughout the power grid makes available new demand resources and storage capacity. These resources have to be jointly managed for efficient and resilient operation. Therefore a resilient communication network is mandatory for the smart control of these different resources. Communication networks in turn also rely on the power networks in spite of some power backup that they may have. This interdependence is especially critical in bad weather conditions where both networks can be severely affected, even more when they strongly depend on each other. This work describes ongoing research related with the interdependence between both networks regarding resilience, cascading failure effects, applicable models and simulation techniques.

2017Conference object

Restricted access

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Publication . Gomes, Teresa; Jorge, Luísa; Melo, Paulo; Girão-Silva, Rita

Path protection is a fast and capacity-efficient approach for increasing the availability of end-to-end connections. However, sometimes it is not possible to obtain a fully disjoint path pair. In this case, it may be admissible to consider a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single-fault protection that can be ensured using this type of approach. A shared risk link group (SRLG) is a group of links which have a common risk of failure. Two new heuristics for solving the min-sum maximally node and SRLG-disjoint path pair are presented. The relative performance of the new heuristics and also of two other previously proposed heuristics is evaluated using four different networks. Results, regarding accuracy and execution time of the studied heuristics, show that one of the new proposed algorithms can be a good compromise for use in the Generalized Multi-protocol Label Switching control plane.

2016Journal article

Open access