Fast Leader (Full) Recovery Despite Dynamic Faults - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Fast Leader (Full) Recovery Despite Dynamic Faults

Résumé

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 ≥ 18k + 1, our protocol recovers the leader in O(k^2) rounds using O(logk) 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.

Dates et versions

hal-00930061 , version 1 (14-01-2014)

Identifiants

Citer

Ajoy Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil. Fast Leader (Full) Recovery Despite Dynamic Faults. International Conference on Distributed Computing and Networking, Jan 2013, Mumbai, India. pp.428-433, ⟨10.1007/978-3-642-35668-1_30⟩. ⟨hal-00930061⟩
292 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More