Resilience of dynamic overlays through local interactions

Abstract

This paper presents a self-organizing protocol for dynamic (unstructured P2P) overlay networks, which allows to react to the variability of node arrivals and departures. Through local interactions, the protocol avoids that the departure of nodes causes a partitioning of the overlay. We show that it is sufficient to have knowledge about 1st and 2nd neighbours, plus a simple interaction P2P protocol, to make unstructured networks resilient to node faults. A simulation assessment over different kinds of overlay networks demonstrates the viability of the proposal.

On the topology maintenance of dynamic P2P overlays through self-healing local interactions

“…The calculation of these metrics usually involves a full (or partially full) knowledge about the whole network. Conversely, the aim of this work is to preserve connectivity without such a global knowledge [9], [14], [19].…”

“…This possible situation triggers a decentralized procedure to guarantee that all those connections with 2nd neighbors, which are lost due to the removal of the intermediate node, are get back. It suffices that only one node, in a set of connected neighbors, creates a novel link with each lost 2nd neighbor [9]. The interesting aspect of this mechanism is that it does not require full knowledge of the overlay network [14], [19].…”