A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

DOI10.1145/1582716.1582741MaRDI QIDQ5170310zbMATH OpenOpenAlexFDO

Authors Riko Jacob, Stefan Schmid, Hanjo Täubig, Andrea Richa, Christian Scheideler

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)

Recommendations

• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Building self-stabilizing overlay networks with the transitive closure framework
• HyperTree for self-stabilizing peer-to-peer systems
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Cited in

(22)

• Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
• HyperTree for self-stabilizing peer-to-peer systems
• A note on the parallel runtime of self-stabilizing graph linearization
• A deterministic worst-case message complexity optimal solution for resource discovery
• Self-adjusting grid networks to minimize expected path length
• Distributed agreement in dynamic peer-to-peer networks
• Towards worst-case churn resistant peer-to-peer systems
• Discovery through gossip
• Self-adjusting grid networks to minimize expected path length
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
• Building self-stabilizing overlay networks with the transitive closure framework
• Corona: a stabilizing deterministic message-passing skip list
• Tiara: a self-stabilizing deterministic skip list and skip graph
• scientific article; zbMATH DE number 2080920 (Why is no real title available?)
• Re-Chord: a self-stabilizing chord overlay network
• Towards a universal approach for the finite departure problem in overlay networks
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Self-stabilizing metric graphs
• Expansion and flooding in dynamic random networks with node churn
• Applications and Implications of a General Framework for Self-Stabilizing Overlay Networks
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170310)