HyperTree for self-stabilizing peer-to-peer systems
From MaRDI portal
Publication:1954258
DOI10.1007/s00446-007-0038-9zbMath1266.68096MaRDI QIDQ1954258
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
68P05: Data structures
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
On the Complexity of Local Graph Transformations, Corona: a stabilizing deterministic message-passing skip list, Tiara: a self-stabilizing deterministic skip list and skip graph, Maintaining the Ranch topology, Towards a universal approach for the finite departure problem in overlay networks, A self-stabilizing Hashed Patricia Trie, A note on the parallel runtime of self-stabilizing graph linearization, A deterministic worst-case message complexity optimal solution for resource discovery, Self-Stabilizing Prefix Tree Based Overlay Networks
Uses Software
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