The scale and complexity of distributed systems have steadily grown in the recent years.
Management of this complexity has drawn attention towards systems that can automatically …

We consider the problem of self-healing in reconfigurable networks (eg peer-to-peer and
wireless mesh networks) that are under repeated attack by an omniscient adversary and …

We consider the problem of self-healing in peer-to-peer networks that are under repeated
attack by an omniscient adversary. We assume that, over a sequence of rounds, an …

We present a fully-distributed self-healing algorithm dex that maintains a constant degree
expander network in a dynamic setting. To the best of our knowledge, our algorithm provides …

Many modern networks are reconfigurable, in the sense that the topology of the network can
be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc …

In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, eg,
such a dense subgraph could reveal dense substructures in otherwise sparse graphs (eg …

Existing compact routing schemes, eg, Thorup and Zwick [SPAA 2001] and Chechik [PODC
2013], often have no means to tolerate failures, once the system has been setup and started …

Healing algorithms play a crucial part in distributed peer-to-peer networks where failures
occur continuously and frequently. Whereas there are approaches for robustness that rely …

Recent years have seen significant interest in designing networks that are self-healing in the
sense that they can automatically recover from adversarial attacks. Previous work shows that …

Many infrastructure networks are considered the backbone of our society; however,
increasing disasters and terrors cause serious damage to energy, water, communication …