HyperTree for self-stabilizing peer-to-peer systems

DOI10.1007/S00446-007-0038-9zbMath1266.68096OpenAlexW2043275827MaRDI QIDQ1954258

Ronen I. Kat, Shlomi Dolev

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-007-0038-9

zbMATH Keywords

self-stabilizationoverlay networkspeer-to-peer

Mathematics Subject Classification ID

Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (9)

A self-stabilizing Hashed Patricia Trie ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Maintaining the Ranch topology ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ On the Complexity of Local Graph Transformations ⋮ Self-Stabilizing Prefix Tree Based Overlay Networks ⋮ A deterministic worst-case message complexity optimal solution for resource discovery

Uses Software

• Chord
• Pastry

Cites Work

• Accessing nearby copies of replicated objects in a distributed environment
• Connection management without retaining information
• The small-world phenomenon
• Self-stabilizing systems in spite of distributed control
• Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
• Viceroy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HyperTree for self-stabilizing peer-to-peer systems