Analysis of an Asymmetric Leader Election Algorithm

Abstract : We consider a leader election algorithm in which a set of distributed objects (people, computers, etc.) try to identify one object as their leader. The election process is randomized, that is, at every stage of the algorithm those objects that survived so far flip a {\it biased} coin, and those who received, say a tail, survive for the next round. The process continues until only one objects remains. Our interest is in evaluating the limiting distribution and the first two moments of the number of rounds needed to select a leader. We establish precise asymptotics for the first two moments, and show that the asymptotic expression for the duration of the algorithm exhibits some periodic fluctuations and consequently no limiting distribution exists. These results are proved by analytical techniques of the precise analysis of algorithms such as: analytical poissonization and depoissonization, Mellin transform, and complex analysis.
Type de document :
RR-3089, INRIA. 1997
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:17:44
Dernière modification le : samedi 27 janvier 2018 - 01:31:30
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:51:43



  • HAL Id : inria-00073602, version 1



Svante Janson, Wojciech Szpankowski. Analysis of an Asymmetric Leader Election Algorithm. RR-3089, INRIA. 1997. 〈inria-00073602〉



Consultations de la notice


Téléchargements de fichiers