Related papers: Simple and efficient self-healing strategy for dam…
We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set…
Distributed storage systems provide large-scale reliable data storage services by spreading redundancy across a large group of storage nodes. In such a large system, node failures take place on a regular basis. When a storage node breaks…
We consider the self organizing process of merging and regeneration of vertices in complex networks and demonstrate that a scale-free degree distribution emerges in a steady state of such a dynamics. The merging of neighbor vertices in a…
It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the high computational complexity. In this paper, we propose a…
Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset…
Data sharding, a technique for partitioning and distributing data among multiple servers or nodes, offers enhancements in the scalability, performance, and fault tolerance of extensive distributed systems. Nonetheless, this strategy…
The effects of link rewiring are considered for the class of directed networks where each node has the same fixed out-degree. We model a network generated by three mechanisms that are present in various networked systems; growth, global…
Epidemic containment is a major concern when confronting large-scale infections in complex networks. Many works have been devoted to analytically understand how to restructure the network to minimize the impact of major outbreaks of…
From physics to engineering, biology and social science, natural and artificial systems are characterized by interconnected topologies whose features - e.g., heterogeneous connectivity, mesoscale organization, hierarchy - affect their…
In this paper, given a random uniform distribution of sensor nodes on a 2-D plane, a fast self-organized distributed algorithm is proposed to find the maximum number of partitions of the nodes such that each partition is connected and…
The ever increasing utilization of sensitive loads in the industrial, commercial and residential areas in distribution networks requires enhanced reliability and quality of supply. This can be achieved thanks to self healing features of…
In this paper, we consider classic randomized low diameter decomposition procedures for planar graphs that obtain connected clusters which are cohesive in that close-by pairs of nodes are assigned to the same cluster with high probability.…
Most modern communication networks include fast rerouting mechanisms, implemented entirely in the data plane, to quickly recover connectivity after link failures. By relying on local failure information only, these data plane mechanisms…
The traditional approach to network robustness, is based on comparing network parameters before and after an event of nodes removal, such as the change in network diameter, the change in giant component size and the existence of giant…
Extensive research has focused on studying the robustness of interdependent non-directed networks and the design of mitigation strategies aimed at reducing disruptions caused by cascading failures. However, real systems such as power and…
Designing effective recovery strategies for damaged networked systems is critical to the resilience of built, human and natural systems. However, progress has been limited by the inability to bring together distinct philosophies, such as…
In this paper we study the resilience of peer-to-peer networks to preferential attacks. We define a network model and experiment with three di erent simple repairing algorithms, out of which the so called 2nd neighbor rewiring algorithm is…
The coordination of robot swarms - large decentralized teams of robots - generally relies on robust and efficient inter-robot communication. Maintaining communication between robots is particularly challenging in field deployments.…
The air transportation network, a fundamental component of critical infrastructure, is formed from a collection of individual air carriers, each one with a methodically designed and engineered network structure. We analyze the individual…
We investigate the spread of an infection or other malfunction of cascading nature when a system component can recover only if it remains reachable from a functioning central component. We consider the susceptible-infected-susceptible…