The hyperring: a low-congestion deterministic data structure for distributed environments
From MaRDI portal
Recommendations
- Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time
- Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
- Asynchronous shared memory search structures
- Low-contention data structures
- \(D^{3}\)-tree: a dynamic deterministic decentralized structure
Cited in
(15)- Concurrent maintenance of rings
- Towards a universal approach for the finite departure problem in overlay networks
- A deterministic worst-case message complexity optimal solution for resource discovery
- Distributed agreement in dynamic peer-to-peer networks
- Towards worst-case churn resistant peer-to-peer systems
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
- Corona: a stabilizing deterministic message-passing skip list
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Re-Chord: a self-stabilizing chord overlay network
- scientific article; zbMATH DE number 7561283 (Why is no real title available?)
- Resource Burning for Permissionless Systems (Invited Paper)
- Towards a universal approach for the finite departure problem in overlay networks
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- Expansion and flooding in dynamic random networks with node churn
- Reducing communication costs in robust peer-to-peer networks
This page was built for publication: The hyperring: a low-congestion deterministic data structure for distributed environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501273)
