This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
35th Annual Symposium on Foundations of Computer Science (FOCS 1994)
Santa Fe, NM, USA
November 20-November 22
ISBN: 0-8186-6580-7
G. Itkis, Boston Univ., MA, USA
L. Levin, Boston Univ., MA, USA
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.
Index Terms:
time polynomial, self-stabilizing asynchronous protocols, asynchronous general topology dynamic networks, identical nameless nodes, worst-case transient faults, faulty configuration
Citation:
G. Itkis, L. Levin, "Fast and lean self-stabilizing asynchronous protocols," focs, pp.226-239, 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), 1994
Usage of this product signifies your acceptance of the Terms of Use.