The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

<p>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 adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes <em>v</em> and <em>w</em> whose distance would have been <em>l</em> in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most <em>l</em> log <em>n</em> in the actual graph, where <em>n</em> is the total number of vertices seen so far. Similarly, at any point, a node <em>v</em> whose degree would have been <em>d</em> in the graph with adversarial insertions only, will have degree at most 3<em>d</em> in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.</p>