Corona: a stabilizing deterministic message-passing skip list

DOI10.1016/J.TCS.2012.08.029MaRDI QIDQ392011zbMATH OpenOpenAlexFDO

Authors Rizal Mohd Nor, Christian Scheideler, Mikhail 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

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

Recommendations

• Tiara: a self-stabilizing deterministic skip list and skip graph
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Building self-stabilizing overlay networks with the transitive closure framework

Cites work

• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A self-stabilizing and local Delaunay graph construction
• HyperTree for self-stabilizing peer-to-peer systems
• Linearization: locally self-stabilizing sorting in graphs
• Principles of Distributed Systems
• Self-stabilizing systems in spite of distributed control
• The hyperring: a low-congestion deterministic data structure for distributed environments
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Time complexity of distributed topological self-stabilization: the case of graph linearization
• Unreliable failure detectors for reliable distributed systems
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(5)

• 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
• Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure
• On the Complexity of Local Graph Transformations

Describes a project that uses

Uses Software

• Pastry

This page was built for publication: Corona: a stabilizing deterministic message-passing skip list

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