On the distribution for the duration of a randomized leader election algorithm

We investigate the duration of an elimination process for identifying a loser by coin tossing, or, equivalently, the height of a random incomplete trie. Applications of the prOcess include the election of a leader in a computer network. Using direct probabilistic arguments we obtain exact expressions for the discrete distribution and the moments of the height. Elementary approximation techniques then yield asymptotics for the distribution. We show that no limiting distribution exists, as the asymptotic expressions exhibit periodic fluctuations. In many similar problems associated with digital trees, no such exact expressions can be derived. We therefore outline a powerful general approach, based on the analytic techniques of Mellin transforms, Poissonlzation, and de-Poissonlzation, from wh.ich distributional asymptotics for the height can also be derived. In fact, it was this complex variables approach that led to our original discovery of the exact distribution. Complex ;:malysis methods are indispensable for deriving asymptotic expressions for the mean and variance, which also contain periodic terms of small magnitude.