Leader Election in Rings with Bounded Multiplicity (Short Paper)
暂无分享,去创建一个
We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings \(\mathcal K_k\) with bounded multiplicity \(k \ge 2\). However, we show that process-terminating leader election is possible in the sub-class \(\mathcal U^* \cap \mathcal K_k\), where \(\mathcal U^*\) is the class of rings which contain a process with a unique label.
[1] Carole Delporte-Gallet,et al. Leader Election in Rings with Homonyms , 2014, NETYS.
[2] Rachid Guerraoui,et al. Byzantine agreement with homonyms , 2011, PODC.
[3] Andrzej Pelc,et al. Leader Election in Rings with Nonunique Labels , 2004, Fundam. Informaticae.