Fast and lean self-stabilizing asynchronous protocols
Itkis, G.
Levin, L.
Boston Univ., MA;
This paper appears in: Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Publication Date: 20-22 Nov 1994
On page(s): 226-239
Meeting Date: 11/20/1994 - 11/22/1994
Location: Santa Fe, NM, USA
ISBN: 0-8186-6580-7
References Cited: 22
INSPEC Accession Number: 4865029
Digital Object Identifier: 10.1109/SFCS.1994.365691
Posted online: 2002-08-06 19:20:35.0
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
