Maximally spatial-disjoint lightpaths in optical networks

Lightpaths enable end-to-end all-optical transmission between network nodes. For survivable routing, traffic is often carried on a primary lightpath, and rerouted to another disjointed backup lightpath in case of the failure of the primary lightpath. Though both lightpaths can be physically disjointed, they can still fail simultaneously if a disaster affects them simultaneously on the physical plane. Hence, we propose a routing algorithm for provisioning a pair of link-disjoint lightpaths between two network nodes such that the minimum spatial distance between them (while disregarding safe regions) is maximized. Through means of simulation, we show that our algorithm can provide higher survivability against spatial-based simultaneous link failures (due to the maximized spatial distance)

The minimum cost D-geodiverse anycast routing with optimal selection of anycast nodes

Consider a geographical network with associated link costs. In anycast routing, network nodes are partitioned into two sets - the source nodes and the anycast (destination) nodes - and the traffic of each source node is routed towards the anycast node providing the minimum routing cost path. By considering a given geographical distance parameter D, we define an anycast routing solution as D-geodiverse when for each source node there are two routing paths, each one towards a different anycast node, such that the geographical distance between the two paths is at least D. Such a solution has the property that any disaster with a coverage diameter below D affecting one routing path (but without involving neither the source node nor its entire set of outgoing links) cannot affect the other path, enhancing in this way the network robustness to natural disasters. The selection of the anycast nodes has an impact both on the feasibility and cost of a D- geodiverse anycast routing solution. Therefore, for a desired number of anycast nodes R, we define the minimum cost D- geodiverse anycast problem (MCD-GAP) aiming to identify a set of R anycast nodes that obtain a minimum cost routing solution. The problem is defined based on integer linear programming and is extended to consider the existence of vulnerability regions in the network, i.e., by imposing the geographical distance D only between network elements belonging to the same region. We present computational results showing the tradeoff between D and R in the optimal solutions obtained with and without vulnerability regions.This paper is based upon work from COST Action CA15127 ("Resilient communication services protecting end user applications from disaster-based failures ‒ RECODIS") supported by COST Association. The work was financially supported by FCT, Portugal, under the projects CENTRO- 01-0145-FEDER-029312 and UID/EEA/50008/2013 and through the postdoc grant SFRH/BPD/ 111503/2015.publishe

Spatio-temporal networks: reachability, centrality and robustness

Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded. Through numerical experiments on three real-world urban transport systems, we study the effect of node failure on a network's topological, temporal and spatial structure. We also demonstrate the broader applicability of this framework to three other classes of network. To identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network. This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks

A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters

In order to evaluate the expected availability of a service, a network administrator should consider all possible failure scenarios under the specific service availability model stipulated in the corresponding service-level agreement. Given the increase in natural disasters and malicious attacks with geographically extensive impact, considering only independent single link failures is often insufficient. In this paper, we build a stochastic model of geographically correlated link failures caused by disasters, in order to estimate the hazards a network may be prone to, and to understand the complex correlation between possible link failures. With such a model, one can quickly extract information, such as the probability of an arbitrary set of links to fail simultaneously, the probability of two nodes to be disconnected, the probability of a path to survive a failure, etc. Furthermore, we introduce a pre-computation process, which enables us to succinctly represent the joint probability distribution of link failures. In particular, we generate, in polynomial time, a quasilinear-sized data structure, with which the joint failure probability of any set of links can be computed efficiently.Embedded and Networked System

A survey of strategies for communication networks to protect against large-scale natural disasters

Recent natural disasters have revealed that emergency networks presently cannot disseminate the necessary disaster information, making it difficult to deploy and coordinate relief operations. These disasters have reinforced the knowledge that telecommunication networks constitute a critical infrastructure of our society, and the urgency in establishing protection mechanisms against disaster-based disruptions

Métodos de melhoria da disponibilidade e da resiliência a desastres em redes de telecomunicações

In current societies, telecommunication networks are one of its essential components, in which different services depend on. Critical service requires these networks to provide high levels of availability between their nodes and high levels of resilient to large-scale natural disasters, either by avoiding them or quickly recover from them. Different techniques can be used to reach these goals. In this dissertation, it is considered the use of geodiversity routing to reduce the impact of large-scale disasters, with the downside of utilizing longer paths which, in turn, reduces the resulting end-to-end availability. This downside can be corrected if the availability of some network elements are upgraded so that the availability required by critical services is met, while maintaining the geodiversity required to prevent the impact of disasters. In this dissertation, different upgrade strategies are implemented to efficiently identify the network elements required to be upgraded, so that the network can provide critical services with high availability and high resilience to natural disasters.As redes de telecomunicações são um dos componentes essenciais na atual sociedade, no qual vários serviços dependem da sua funcionalidade para operarem eficientemente. O suporte de serviços críticos exige que as redes ofereçam altos níveis de disponibilidade entre os seus nós e sejam altamente resilientes a desastres de larga escala, tais como os provocados por fenómenos naturais (tremores de terra, tsunamis, etc.). Algumas técnicas podem ser implementadas para atingir estes objetivos. Nesta dissertação, considera-se o uso de encaminhamento com geodiversidade para reduzir o impacto de desastres de larga escala, com a desvantagem de exigir percursos de encaminhamento mais longos, reduzindo a disponibilidade resultante entre os nós origem-destino do encaminhamento. Assim, para obter simultaneamente alta disponibilidade e alta resiliência a desastres, é necessário melhorar a disponibilidade em alguns elementos da rede. Nesta dissertação são introduzidas diferentes estratégias para identificar eficazmente os elementos da rede que precisam de ser melhorados em termos de disponibilidade, para que a rede suporte os requisitos de disponibilidade e resiliência a desastres requeridos por serviços críticos.Mestrado em Engenharia Informátic

Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters

To evaluate the expected availability of a backbone network service, the administrator should consider all possible failure scenarios under the specific service availability model stipulated in the corresponding service-level agreement. Given the increase in natural disasters and malicious attacks with geographically extensive impact, considering only independent single component failures is often insufficient. This paper builds a stochastic model of geographically correlated link failures caused by disasters to estimate the hazards an optical backbone network may be prone to and to understand the complex correlation between possible link failures. We first consider link failures only and later extend our model also to capture node failures. With such a model, one can quickly extract essential information such as the probability of an arbitrary set of network resources to fail simultaneously, the probability of two nodes to be disconnected, the probability of a path to survive a disaster. Furthermore, we introduce standard data structures and a unified terminology on Probabilistic Shared Risk Link Groups (PSRLGs), along with a pre-computation process, which represents the failure probability of a set of resources succinctly. In particular, we generate a quasilinear-sized data structure in polynomial time, which allows the efficient computation of the cumulative failure probability of any set of network elements. Our evaluation is based on carefully pre-processed seismic hazard data matched to real-world optical backbone network topologies.Accepted author manuscriptEmbedded and Networked System

Resilience of the Critical Communication Networks Against Spreading Failures: Case of the European National and Research Networks

A backbone network is the central part of the communication network, which provides connectivity within the various systems across large distances. Disruptions in a backbone network would cause severe consequences which could manifest in the service outage on a large scale. Depending on the size and the importance of the network, its failure could leave a substantial impact on the area it is associated with. The failures of the network services could lead to a significant disturbance of human activities. Therefore, making backbone communication networks more resilient directly affects the resilience of the area. Contemporary urban and regional development overwhelmingly converges with the communication infrastructure expansion and their obvious mutual interconnections become more reciprocal. Spreading failures are of particular interest. They usually originate in a single network segment and then spread to the rest of network often causing a global collapse. Two types of spreading failures are given focus, namely: epidemics and cascading failures. How to make backbone networks more resilient against spreading failures? How to tune the topology or additionally protect nodes or links in order to mitigate an effect of the potential failure? Those are the main questions addressed in this thesis. First, the epidemic phenomena are discussed. The subjects of epidemic modeling and identification of the most influential spreaders are addressed using a proposed Linear Time-Invariant (LTI) system approach. Throughout the years, LTI system theory has been used mostly to describe electrical circuits and networks. LTI is suitable to characterize the behavior of the system consisting of numerous interconnected components. The results presented in this thesis show that the same mathematical toolbox could be used for the complex network analysis. Then, cascading failures are discussed. Like any system which can be modeled using an interdependence graph with limited capacity of either nodes or edges, backbone networks are prone to cascades. Numerical simulations are used to model such failures. The resilience of European National Research and Education Networks (NREN) is assessed, weak points and critical areas of the network are identified and the suggestions for its modification are proposed

Finding critical regions and region-disjoint paths in a network

Due to their importance to society, communication networks should be built and operated to withstand failures.However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their network. Considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region - a part of the network that can be enclosed by a given elementary figure of predetermined size - whose destruction would lead to the highest network disruption.We determine that only a polynomial,in the input, number of non-trivial positions for such a figure need to be considered and propose a corresponding polynomialtime algorithm. In addition, we consider region-aware network augmentation to decrease the impact of a regional failure. We subsequently address the region-disjoint paths problem, which asks for two paths with minimum total weight between a source (s) and a destination (d) that cannot both be cut by a single regional failure of diameter D (unless that failure includes s or d). We prove that deciding whether region-disjoint paths exist is NP-hard and propose a heuristic region-disjoint paths algorithm.Network Architectures & Services (NAS)Electrical Engineering, Mathematics and Computer Scienc