scholarly journals Analysis of an Asymmetric Leader Election Algorithm

10.37236/1302 ◽  
1997 ◽  
Vol 4 (1) ◽  
Author(s):  
Svante Janson ◽  
Wojciech Szpankowski
Keyword(s):  
Complex Analysis ◽  
Analysis Of Algorithms ◽  
Asymptotic Expression ◽  
Analytical Techniques ◽  
Leader Election ◽  
Limiting Distribution ◽  
Election Process ◽  
Precise Analysis ◽  
Election Algorithm ◽  
Leader Election Algorithm

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 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.

scholarly journals The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis

2012 ◽  
Vol Vol. 14 no. 2 (Analysis of Algorithms) ◽  
Author(s):  
Guy Louchard ◽  
Helmut Prodinger
Keyword(s):  
Mellin Transform ◽  
Analysis Of Algorithms ◽  
Early Stage ◽  
Success Probability ◽  
Companion Paper ◽  
Leader Election ◽  
International Audience ◽  
Election Algorithm ◽  
Probability Number ◽  
Leader Election Algorithm

Analysis of Algorithms International audience We study a leader election protocol that we call the Swedish leader election protocol. This name comes from a protocol presented by L. Bondesson, T. Nilsson, and G. Wikstrand (2007). The goal is to select one among n > 0 players, by proceeding through a number of rounds. If there is only one player remaining, the protocol stops and the player is declared the leader. Otherwise, all remaining players flip a biased coin; with probability q the player survives to the next round, with probability p = 1 - q the player loses (is killed) and plays no further ... unless all players lose in a given round (null round), so all of them play again. In the classical leader election protocol, any number of null rounds may take place, and with probability 1 some player will ultimately be elected. In the Swedish leader election protocol there is a maximum number tau of consecutive null rounds, and if the threshold is attained the protocol fails without declaring a leader. In this paper, several parameters are asymptotically analyzed, among them: Success Probability, Number of rounds R-n, Number of null rounds T-n. This paper is a companion paper to Louchard, Martinez and Prodinger (2011) where De-Poissonization was used, together with the Mellin transform. While this works fine as far as it goes, there are limitations, in particular of a computational nature. The approach chosen here is similar to earlier efforts of the same authors - Louchard and Prodinger (2004,2005,2009). Identifying some underlying distributions as Gumbel (type) distributions, one can start with approximations at a very early stage and compute (at least in principle) all moments asymptotically. This is in contrast to the companion work, where only expected values were considered. In an appendix, it is shown that, whereever results are given in both papers, they coincide, although they are presented in different ways.

A Novel Hypergraph-Based Leader Election Algorithm for Distributed Systems

2020 ◽  
pp. 437-445
Author(s):  
E. R. S. Subramanian ◽  
B. Sri Gurubaran ◽  
A. S. Sayee Shruthi ◽  
V. Aishwarya ◽  
N. Balaji ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Leader Election ◽  
Election Algorithm ◽  
Leader Election Algorithm

Implementing Leader Election Algorithm after Evaluation of Node Trust in MANETs

2017 ◽  
pp. 282-311
Author(s):  
Jayanta Das ◽  
Abhijit Das
Keyword(s):  
Leader Election ◽  
Election Algorithm ◽  
Leader Election Algorithm

Security and trust are two inevitable concepts for secure Manet. There are various systems used for ensuring security and trust in case of Manet. These systems have several advantages as well as several disadvantages in terms high communication and computation overhead. In this proposed trust based system, trust of node is evaluated on the basis of ratio of signal sent and acknowledgement received. After that, priority of each node is calculated and at last Leader Election algorithm is applied to select node leader.

The Asymmetric Leader Election Algorithm: Another Approach

2009 ◽  
Vol 12 (4) ◽  
pp. 449-478 ◽  
Author(s):  
Guy Louchard ◽  
Helmut Prodinger
Keyword(s):  
Leader Election ◽  
Election Algorithm ◽  
Leader Election Algorithm

Predictable Leader Election Algorithm

1995 ◽  
Vol 3 (3) ◽  
pp. 195-201
Author(s):  
Tai Woo Kim ◽  
Tai Yun Kim
Keyword(s):  
Leader Election ◽  
Election Algorithm ◽  
Leader Election Algorithm
Sign in / Sign up

Export Citation Format

Share Document