Re-Chord: a self-stabilizing chord overlay network

DOI10.1007/S00224-012-9431-2MaRDI QIDQ487270zbMATH OpenOpenAlexFDO

Authors Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler

Publication date 19 January 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-012-9431-2

zbMATH Keywords

distributed algorithmspeer-to-peer networksChordself-stabilizing protocols

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Algorithms – ESA 2005
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
• Analysis of the evolution of peer-to-peer systems
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

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?)
• scientific article; zbMATH DE number 1559581 (Why is no real title available?)
• A Distributed and Oblivious Heap
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A self-stabilizing and local Delaunay graph construction
• Linearization: locally self-stabilizing sorting in graphs
• Novel architectures for P2P applications: the continuous-discrete approach
• Parallel Processing and Applied Mathematics
• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Skip graphs
• 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
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(14)

• A self-stabilizing hashed Patricia trie
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Towards a universal approach for the finite departure problem in overlay networks
• \(Chord^{2}\): A two-layer Chord for reducing maintenance overhead via heterogeneity
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
• Towards a universal approach for the finite departure problem in overlay networks
• A note on the parallel runtime of self-stabilizing graph linearization
• A peer-to-peer expressway over Chord
• Analysis of the evolution of peer-to-peer systems
• Self-stabilizing metric graphs
• Self-stabilizing prefix tree based overlay networks
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
• Algorithms – ESA 2005
• Mechanically verifying the fundamental liveness property of the Chord protocol

Describes a project that uses

Uses Software

• EpiChord
• Chord

This page was built for publication: Re-Chord: a self-stabilizing chord overlay network

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