Fast and Lean Self-Stabilizing Asynchronous Protocols

We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self-stabilzze any computation zn time polynomial in the (unknown) network dzameter Thzs version sacrzfices some dzversity of tasks and efficiency for simplicity and claraty of detazls. Appendax gives more eficient procedures in less detaal.

• Type: Conference
• Year: 1994
• Where: FOCS
• Authors: Gene Itkis, Leonid A. Levin
• Keywords: FOCS 1994, Identical Nameless Nodes, Theoretical Computer Science, Worst-case Transient Faults, Zn Time Polynomial