Title :
Fast and lean self-stabilizing asynchronous protocols
Author :
Itkis, Gene ; Levin, Leonid
Author_Institution :
Boston Univ., MA, USA
Abstract :
We consider asynchronous general topology dynamic networks of identical nameless nodes with worst-case transient faults. Starting from any faulty configuration, our protocols self-stabilize any computation in time polynomial in the (unknown) network diameter. This version sacrifices some diversity of tasks and efficiency for simplicity and clarity of details. Appendix gives more efficient procedures in less detail
Keywords :
protocols; asynchronous general topology dynamic networks; faulty configuration; identical nameless nodes; self-stabilizing asynchronous protocols; time polynomial; worst-case transient faults; Algorithms; Clocks; Computer networks; Counting circuits; Distributed computing; Network topology; Nominations and elections; Polynomials; Protocols; Resists;
Conference_Titel :
Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Conference_Location :
Santa Fe, NM
Print_ISBN :
0-8186-6580-7
DOI :
10.1109/SFCS.1994.365691
