115,685 research outputs found
Infrastructure network vulnerability
The work presented in this paper aims to propose a methodology of analyzing infrastructure network vulnerability in the field of prevention or reduction of the natural disaster consequences. After a state of the art on vulnerability models in the academic literature, the various vulnerability factors are classified and discussed. Eventually, a general model of vulnerability analysis including societal parameters is presented
Ricci Curvature of the Internet Topology
Analysis of Internet topologies has shown that the Internet topology has
negative curvature, measured by Gromov's "thin triangle condition", which is
tightly related to core congestion and route reliability. In this work we
analyze the discrete Ricci curvature of the Internet, defined by Ollivier, Lin,
etc. Ricci curvature measures whether local distances diverge or converge. It
is a more local measure which allows us to understand the distribution of
curvatures in the network. We show by various Internet data sets that the
distribution of Ricci cuvature is spread out, suggesting the network topology
to be non-homogenous. We also show that the Ricci curvature has interesting
connections to both local measures such as node degree and clustering
coefficient, global measures such as betweenness centrality and network
connectivity, as well as auxilary attributes such as geographical distances.
These observations add to the richness of geometric structures in complex
network theory.Comment: 9 pages, 16 figures. To be appear on INFOCOM 201
Pseudo-Separation for Assessment of Structural Vulnerability of a Network
Based upon the idea that network functionality is impaired if two nodes in a
network are sufficiently separated in terms of a given metric, we introduce two
combinatorial \emph{pseudocut} problems generalizing the classical min-cut and
multi-cut problems. We expect the pseudocut problems will find broad relevance
to the study of network reliability. We comprehensively analyze the
computational complexity of the pseudocut problems and provide three
approximation algorithms for these problems.
Motivated by applications in communication networks with strict
Quality-of-Service (QoS) requirements, we demonstrate the utility of the
pseudocut problems by proposing a targeted vulnerability assessment for the
structure of communication networks using QoS metrics; we perform experimental
evaluations of our proposed approximation algorithms in this context
Cascading failures in spatially-embedded random networks
Cascading failures constitute an important vulnerability of interconnected
systems. Here we focus on the study of such failures on networks in which the
connectivity of nodes is constrained by geographical distance. Specifically, we
use random geometric graphs as representative examples of such spatial
networks, and study the properties of cascading failures on them in the
presence of distributed flow. The key finding of this study is that the process
of cascading failures is non-self-averaging on spatial networks, and thus,
aggregate inferences made from analyzing an ensemble of such networks lead to
incorrect conclusions when applied to a single network, no matter how large the
network is. We demonstrate that this lack of self-averaging disappears with the
introduction of a small fraction of long-range links into the network. We
simulate the well studied preemptive node removal strategy for cascade
mitigation and show that it is largely ineffective in the case of spatial
networks. We introduce an altruistic strategy designed to limit the loss of
network nodes in the event of a cascade triggering failure and show that it
performs better than the preemptive strategy. Finally, we consider a real-world
spatial network viz. a European power transmission network and validate that
our findings from the study of random geometric graphs are also borne out by
simulations of cascading failures on the empirical network.Comment: 13 pages, 15 figure
- …