Self-Stabilizing Prefix Tree Based Overlay Networks
From MaRDI portal
Publication:2833545
DOI10.1142/S0129054116500192zbMath1392.68096MaRDI QIDQ2833545
Franck Petit, Ajoy K. Datta, Eddy Caron, Cédric Tedeschi
Publication date: 18 November 2016
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
fault-tolerancedistributed algorithmsself-stabilizationoverlay networksservice discoveryprefix trees
Data structures (68P05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Re-Chord: a self-stabilizing chord overlay network
- Available stabilizing heaps
- MAAN: A multi-attribute addressable network for grid information services
- Concurrent maintenance of rings
- HyperTree for self-stabilizing peer-to-peer systems
- A note on the parallel runtime of self-stabilizing graph linearization
- Self-stabilizing systems in spite of distributed control
- A set of level 3 basic linear algebra subprograms
This page was built for publication: Self-Stabilizing Prefix Tree Based Overlay Networks