MULTISKIPGRAPH: A Self-Stabilizing Overlay Network that Maintains Monotonic Searchability

Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. However, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network. In this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph.

[1]  Christian Scheideler,et al.  Re-Chord: a self-stabilizing chord overlay network , 2011, SPAA.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Sébastien Tixeuil,et al.  Infinite Unlimited Churn (Short Paper) , 2016, SSS.

[4]  Douglas S. Reeves,et al.  Self-stabilizing structured ring topology P2P systems , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[5]  Christian Scheideler,et al.  Self-stabilizing Overlays for high-dimensional Monotonic Searchability , 2018, SSS.

[6]  Ajoy Kumar Datta,et al.  Snap-stabilization and PIF in tree networks , 2007, Distributed Computing.

[7]  Christian Scheideler,et al.  SKIP+: A Self-Stabilizing Skip Graph , 2014, JACM.

[8]  Colette Johnen,et al.  Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters , 2010, Euro-Par.

[9]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[10]  Christian Scheideler,et al.  A Self-Stabilization Process for Small-World Networks , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[11]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

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

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

[14]  Christian Scheideler,et al.  Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures , 2015, OPODIS.

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

[16]  Sébastien Tixeuil,et al.  Monotonic Stabilization , 2010, OPODIS.

[17]  Christian Scheideler,et al.  Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks , 2016, DISC.

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

[19]  Christian Scheideler,et al.  Linearization: Locally Self-Stabilizing Sorting in Graphs , 2007, ALENEX.

[20]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[21]  Christian Scheideler,et al.  Towards a Universal Approach for the Finite Departure Problem in Overlay Networks , 2015, Inf. Comput..

[22]  Christian Scheideler,et al.  A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization , 2013, Theory of Computing Systems.

[23]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[24]  Hirotsugu Kakugawa,et al.  A self-stabilizing minimal dominating set algorithm with safe convergence , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[25]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.