Corona: a stabilizing deterministic message-passing skip list

DOI10.1016/j.tcs.2012.08.029zbMath1358.68026OpenAlexW2009821304MaRDI QIDQ392011

Christian Scheideler, Rizal Mohd Nor, Mikhail V. Nesterenko

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.029

zbMATH Keywords

self-stabilizationpeer-to-peer networksoverlay networksmessage-passing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items

Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs ⋮ On the Complexity of Local Graph Transformations

Uses Software

• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tiara: a self-stabilizing deterministic skip list and skip graph
• HyperTree for self-stabilizing peer-to-peer systems
• Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
• A Self-stabilizing and Local Delaunay Graph Construction
• Self-stabilizing systems in spite of distributed control
• Unreliable failure detectors for reliable distributed systems
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Viceroy
• Linearization: Locally Self-Stabilizing Sorting in Graphs
• Principles of Distributed Systems