2013 | OriginalPaper | Buchkapitel
Fast Leader (Full) Recovery Despite Dynamic Faults
verfasst von : Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil
Erschienen in: Distributed Computing and Networking
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We give a leader recovery protocol that recovers a legitimate configuration where a single leader exists, after at most
k
arbitrary memory corruptions hit the system. That is, if a leader is elected before state corruptions, the
same
leader is elected after recovery. Our protocol works in any anonymous bidirectional, yet oriented, ring of size
n
, and does
not
require that processes know
n
, although the knowledge of
k
is assumed. If
n
≥ 18
k
+ 1, our protocol recovers the leader in
$O(k^{{{\scriptscriptstyle2}}})$
rounds using
O
(log
k
) bits per process, assuming unfair scheduling. Our protocol handles
dynamic
faults in the sense that memory corruption may still occur while the network has started recovering the leader.