Picking up the Pieces: Self-Healing in Reconfigurable Networks

We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity in these networks, even in the presence of repeated adversarial node deletion, by carefully adding edges after each attack. We present a new algorithm, DASH, that provably ensures that: 1) the network stays connected even if an adversary deletes up to all nodes in the network; and 2) no node ever increases its degree by more than 2 log n, where n is the number of nodes initially in the network. DASH is fully distributed; adds new edges only among neighbors of deleted nodes; and has average latency and bandwidth costs that are at most logarithmic in n. DASH has these properties irrespective of the topology of the initial network, and is thus orthogonal and complementary to traditional topologybased approaches to defending against attack. We also prove lower-bounds showing that DASH is asymptotically optimal i...

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Jared Saia, Amitabh Trehan
• Keywords: Adversarial Node Deletion, CORR 2008, DASH, Education, Node