Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.

[1]  Christian Scheideler,et al.  Towards a Scalable and Robust DHT , 2006, SPAA '06.

[2]  Christian Scheideler,et al.  Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization , 2010, LATIN.

[3]  Christian Scheideler,et al.  How to spread adversarial nodes?: rotate! , 2005, STOC '05.

[4]  Christian Scheideler,et al.  On Stabilizing Departures in Overlay Networks , 2014, SSS.

[5]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[6]  Jared Saia,et al.  Picking up the Pieces: Self-Healing in reconfigurable networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[7]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[8]  Christian Scheideler,et al.  Tiara: A self-stabilizing deterministic skip list and skip graph , 2012, Theor. Comput. Sci..

[9]  Christian Scheideler,et al.  Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs , 2012, Theor. Comput. Sci..

[10]  Christian Scheideler,et al.  Stabilizing consensus with the power of two choices , 2011, SPAA '11.

[11]  Stefan Schmid,et al.  Towards worst-case churn resistant peer-to-peer systems , 2010, Distributed Computing.

[12]  Michael J. Fischer,et al.  Stabilizing Consensus in Mobile Networks , 2006, DCOSS.

[13]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[14]  Shlomi Dolev,et al.  Spanders: distributed spanning expanders , 2010, SAC '10.

[15]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[16]  Christian Scheideler,et al.  Pagoda: a dynamic overlay network for routing, data management, and multicasting , 2004, SPAA '04.

[17]  Andrew Berns,et al.  Building self-stabilizing overlay networks with the transitive closure framework , 2011, Theor. Comput. Sci..

[18]  Christian Scheideler,et al.  A distributed polylogarithmic time algorithm for self-stabilizing skip graphs , 2009, PODC '09.

[19]  Thomas P. Hayes,et al.  The forgiving graph: a distributed data structure for low stretch under adversarial attack , 2009, PODC.

[20]  Robbert van Renesse,et al.  Self-stabilizing and Byzantine-Tolerant Overlay Network , 2007, OPODIS.

[21]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[22]  Christian Scheideler,et al.  Re-Chord: A Self-stabilizing Chord Overlay Network , 2011, SPAA '11.

[23]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[24]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[25]  Roger Wattenhofer,et al.  Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn , 2006, Research Results of the DICS Program.

[26]  Christian Scheideler,et al.  Corona: A stabilizing deterministic message-passing skip list , 2011, Theor. Comput. Sci..

[27]  Thomas Hérault,et al.  Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems , 2006, SSS.

[28]  Christian Scheideler,et al.  The hyperring: a low-congestion deterministic data structure for distributed environments , 2004, SODA '04.