Self-stabilizing prefix tree based overlay networks
From MaRDI portal
Recommendations
Cites work
- A note on the parallel runtime of self-stabilizing graph linearization
- A set of level 3 basic linear algebra subprograms
- Available stabilizing heaps
- Concurrent maintenance of rings
- HyperTree for self-stabilizing peer-to-peer systems
- MAAN: A multi-attribute addressable network for grid information services
- Re-Chord: a self-stabilizing chord overlay network
- Self-stabilizing systems in spite of distributed control
Cited in
(8)- Towards a universal approach for monotonic searchability in self-stabilizing overlay networks
- HyperTree for self-stabilizing peer-to-peer systems
- A self-stabilizing hashed Patricia trie
- Towards establishing monotonic searchability in self-stabilizing data structures
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- A self-stabilizing hashed Patricia trie
- On Stabilizing Departures in Overlay Networks
- Applications and Implications of a General Framework for Self-Stabilizing Overlay Networks
This page was built for publication: Self-stabilizing prefix tree based overlay networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833545)