Building self-stabilizing overlay networks with the transitive closure framework
From MaRDI portal
Publication:391988
DOI10.1016/j.tcs.2013.02.021zbMath1358.68022OpenAlexW153242498MaRDI QIDQ391988
Sriram V. Pemmaraju, Andrew Berns, Sukumar Ghosh
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.021
distributed algorithmsself-stabilizationoverlay networksfault-tolerant algorithmsstabilization bounds
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items
Time-optimal construction of overlay networks, A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks, Towards a universal approach for the finite departure problem in overlay networks, Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs, Towards a Universal Approach for the Finite Departure Problem in Overlay Networks, Self-stabilizing metric graphs, On the Complexity of Local Graph Transformations
Uses Software
Cites Work
- Unnamed Item
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- Distributed Computing: A Locality-Sensitive Approach
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Linearization: Locally Self-Stabilizing Sorting in Graphs