Leader Election in Rings with Homonyms. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Leader Election in Rings with Homonyms.


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.


No file

Dates and versions

hal-01100776 , version 1 (07-01-2015)



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-32⟩. ⟨hal-01100776⟩
135 View
0 Download



Gmail Facebook Twitter LinkedIn More