Memory-efficient and self-stabilizing network RESET (extended abstract)

DOI10.1145/197917.198104zbMath1373.68059OpenAlexW2077892801MaRDI QIDQ5361416

Rafail Ostrovsky, Baruch Awerbuch

Publication date: 29 September 2017

Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/197917.198104

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items

The expressive power of snap-stabilization ⋮ A combinatorial characterization of self-stabilizing population protocols ⋮ The local detection paradigm and its applications to self-stabilization ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ On the computational power of self-stabilizing systems ⋮ The triumph and tribulation of system stabilization ⋮ Deterministic, constant space, self-stabilizing leader election on uniform rings ⋮ A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States ⋮ Snap-stabilization and PIF in tree networks ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative ⋮ Redundancy in distributed proofs