Re-Chord: a self-stabilizing chord overlay network
From MaRDI portal
Publication:487270
DOI10.1007/s00224-012-9431-2zbMath1314.68027OpenAlexW2034971217MaRDI QIDQ487270
Andreas Koutsopoulos, Sebastian Kniesburges, 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
Network design and communication in computer systems (68M10) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (8)
A self-stabilizing Hashed Patricia Trie ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ 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 ⋮ Self-Stabilizing Prefix Tree Based Overlay Networks ⋮ SKIP +
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
- Novel architectures for P2P applications
- A Self-stabilizing and Local Delaunay Graph Construction
- Self-stabilizing systems in spite of distributed control
- Skip graphs
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Viceroy
- Linearization: Locally Self-Stabilizing Sorting in Graphs
- Parallel Processing and Applied Mathematics
- A Distributed and Oblivious Heap
This page was built for publication: Re-Chord: a self-stabilizing chord overlay network