Leader Election in Rings with Homonyms.

Carole Delporte-Gallet 1, 2 Hugues Fauconnier 1, 2 Hung Tran-The 1, 2
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : Considering the case of homonyms processes (some processes may share the same identifier) on a ring, we give here a necessary and sufficient condition on the number of identifiers to enable leader election. We prove that if l is the number of identifiers then message-terminating election is possible if and only if l is greater than the greatest proper divisor of the ring size even if the processes do not know the ring size. If the ring size is known, we propose a process-terminating algorithm exchanging O(n log(n)) messages that is optimal.
keyword : Leader
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01100776
Contributor : Carole Delporte-Gallet <>
Submitted on : Wednesday, January 7, 2015 - 9:47:07 AM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM

Identifiers

Collections

Citation

Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The. Leader Election in Rings with Homonyms.. NETYS, May 2014, Marrackech, Morocco. pp.9-24, ⟨10.1007/978-3-319-09581-3 2⟩. ⟨hal-01100776⟩

Share

Metrics

Record views

270