A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

DOI10.1145/1582716.1582741zbMath1291.68049OpenAlexW2104206977MaRDI QIDQ5170310

Riko Jacob, Stefan Schmid, Hanjo Täubig, Christian Scheideler, Andréa W. Richa

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1582716.1582741

zbMATH Keywords

peer-to-peer systems

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (17)

Towards worst-case churn resistant peer-to-peer systems ⋮ Building self-stabilizing overlay networks with the transitive closure framework ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Expansion and flooding in dynamic random networks with node churn ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks ⋮ Self-stabilizing metric graphs ⋮ Discovery Through Gossip ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ Self-adjusting grid networks to minimize expected path length ⋮ Self-adjusting Grid Networks to Minimize Expected Path Length ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs