Related papers: Examining I2P Resilience: Effect of Centrality-bas…
The vulnerability of networks to targeted attacks is an issue of widespread interest for policymakers, military strategists, network engineers and systems biologists alike. Current approaches to circumvent targeted attacks seek to increase…
Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size…
Power-law networks such as the Internet, terrorist cells, species relationships, and cellular metabolic interactions are susceptible to node failures, yet maintaining network connectivity is essential for network functionality.…
Ever since the introduction of the internet, it has been void of any privacy. The majority of internet traffic currently is and always has been unencrypted. A number of anonymous communication overlay networks exist whose aim it is to…
We study delay tolerant networking (DTN) and in particular, its capacity to store, carry and forward messages so that the messages eventually reach their final destinations. We approach this broad question in the framework of percolation…
We investigate topologically biased failure in scale-free networks with degree distribution $P(k) \propto k^{-\gamma}$. The probability $p$ that an edge remains intact is assumed to depend on the degree $k$ of adjacent nodes $i$ and $j$…
Betweenness centrality lies at the core of both transport and structural vulnerability properties of complex networks, however, it is computationally costly, and its measurement for networks with millions of nodes is near impossible. By…
We developed a scheme for evaluating the size of the largest connected subnetwork (giant component) in random networks and the percolation threshold when sites (nodes) and/or bonds (edges) are removed from the networks based on the cavity…
Social applications mine user social graphs to improve performance in search, provide recommendations, allow resource sharing and increase data privacy. When such applications are implemented on a peer-to-peer (P2P) architecture, the social…
Centrality metrics have been used in various networks, such as communication, social, biological, geographic, or contact networks. In particular, they have been used in order to study and analyze targeted attack behaviors and investigated…
In this work, water distribution systems are regarded as large sparse planar graphs with complex network characteristics and the relationship between important topological features of the network (i.e. structural robustness and loop…
Analyzing networks requires complex algorithms to extract meaningful information. Centrality metrics have shown to be correlated with the importance and loads of the nodes in network traffic. Here, we are interested in the problem of…
This paper proposes a fully decentralized peer-to-peer overlay structure GeoP2P, to facilitate geographic location based search and retrieval of information. Certain limitations of centralized geographic indexes favor peer-to-peer…
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. Typically, in these studies, robustness is assessed only in terms of the connectivity of the nodes unaffected…
Centralized Virtual Private Networks (VPNs) when used in distributed systems have performance constraints as all traffic must traverse through a central server. In recent years, there has been a paradigm shift towards the use of P2P in VPNs…
In many real, directed networks, the strongly connected component of nodes which are mutually reachable is very small. This does not fit with current theory, based on random graphs, according to which strong connectivity depends on mean…
The robustness of complex networks with dependencies has been studied in recent years. However, previous studies focused on the robustness of networks composed of dependency links without network topology. In this study, we will analyze the…
A key performance metric in blockchains is the latency between when a transaction is broadcast and when it is confirmed (the so-called, confirmation latency). While improvements in consensus techniques can lead to lower confirmation…
The promise of decentralized peer-to-peer (P2P) systems is fundamentally gated by the challenge of Network Address Translation (NAT) traversal, with existing solutions often reintroducing the very centralization they seek to avoid. This…