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

DOI10.1145/197917.198104MaRDI QIDQ5361416zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Rafail Ostrovsky

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

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

Cited in

(14)

• The local detection paradigm and its applications to self-stabilization
• On the computational power of self-stabilizing systems
• Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
• Snap-stabilization and PIF in tree networks
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Redundancy in distributed proofs
• The expressive power of snap-stabilization
• A combinatorial characterization of self-stabilizing population protocols
• Leader election and shape formation with self-organizing programmable matter
• The wake up and report problem is time-equivalent to the firing squad synchronization problem
• 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
• Deterministic self-stabilising leader election for programmable matter with constant memory

This page was built for publication: Memory-efficient and self-stabilizing network RESET (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361416)