Convergence of Some Leader Election Algorithms
Christian Lavault2008, Discret. Math. Theor. Comput. Sci.
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
We start with a set of $n$ players. With some probability $P(n,k)$, we kill $n-k$ players; the other ones stay alive, and we repeat with them. What is the distribution of the number $X_n$ of \emph{phases} (or rounds) before getting only one player? We present a probabilistic analysis of this algorithm under some conditions on the probability distributions $P(n,k)$, including stochastic monotonicity and the assumption that roughly a fixed proportion $\al$ of the players survive in each round. We prove a kind of convergence in distribution for $X_n - \log_{1/\!\alpha}(n)$; as in many other similar problems there are oscillations and no true limit distribution, but suitable subsequences converge, and there is an absolutely continuous random variable $Z$ such that $d\l(X_n, \lceil Z + \log_{1/\!\alpha} (n)\rceil\r) \to 0$, where $d$ is either the total variation distance or the Wasserstein distance. Applications of the general result include the leader election algorithm where players a...
Related papers
Analysis of leader election algorithms
We start with a set of n players. With some probability $P(n, k)$, we kill $n−k$ players; the other ones stay alive, and we repeat with them. What is the distribution of the number $X_n$ of phases (or rounds) before getting only one player? We present a probabilistic analysis of this algorithm under some conditions on the probability distributions $P(n, k)$, including stochastic monotonicity and the assumption that roughly a fixed proportion $\alpha$ of the players survive in each round. We prove a kind of convergence in distribution for $\lceilX_n−\log_{1/\alpha}(n)\rceil$; as in many other similar problems there are oscillations and no true limit distribution, but suitable subsequences converge, and there is an absolutely continuous random variable $Z$ such that $d(Xn, \lceilZ+\log_{1/\alpha}(n)\rceil) \to 0$, where d is either the total variation distance or the Wasserstein distance. Applications of the general result include the leader election algorithm where players are elimin...
Asymptotic Properties of a Leader Election Algo-Rithm
gwu.edu
We consider a serialized coin-tossing leader election algorithm that proceeds in rounds until a winner is chosen, or all contestants are eliminated. The analysis allows for either biased or fair coins. We find the exact distribution for the duration of any fixed contestant; asymptotically it turns out to be a geometric distribution. Rice's method (an analytic technique) shows that the moments of the duration contain oscillations, which we give explicitly for the mean and variance. We also use convergence in the Wasserstein metric space to show that the distribution of the total number of coin flips (among all participants), suitably normalized, approaches a normal limiting random variable.
Asymptotic analysis of a leader election algorithm
Theoretical Computer Science, 2006
Itai and Rodeh showed that, on the average, the communication of a leader election algorithm takes no more than LN bits, where L ≃ 2.441716 and N denotes the size of the ring. We give a precise asymptotic analysis of the average number of rounds M (n) required by the algorithm, proving for example that M (∞) := lim n→∞ M (n) = 2.441715879. . ., where n is the number of starting candidates in the election. Accurate asymptotic expressions of the second moment M (2) (n) of the discrete random variable at hand, its probability distribution, and the generalization to all moments are given. Corresponding asymptotic expansions (n → ∞) are provided for sufficiently large j, where j counts the number of rounds. Our numerical results show that all computations perfectly fit the observed values. Finally, we investigate the generalization to probability t/n, where t is a non negative real parameter. The real function M (∞, t) := lim n→∞ M (n, t) is shown to admit one unique minimum M (∞, t *) on the real segment (0, 2). Furthermore, the variations of M (∞, t) on the whole real line are also studied in detail.
On the distribution for the duration of a randomized leader election algorithm
The Annals of Applied Probability, 1996
We investigate the duration of an elimination process for identifying a winner 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 uctuations.
A leader-election procedure using records
The Annals of Probability, 2017
Motivated by the open problem of finding the asymptotic distributional behavior of the number of collisions in a Poisson-Dirichlet coalescent, the following version of a stochastic leaderelection algorithm is studied. Consider an infinite family of persons, labeled by 1, 2, 3,. . ., who generate iid random numbers from an arbitrary continuous distribution. Those persons who have generated a record value, that is, a value larger than the values of all previous persons, stay in the game, all others must leave. The remaining persons are relabeled by 1, 2, 3,. .. maintaining their order in the first round, and the election procedure is repeated independently from the past and indefinitely. We prove limit theorems for a number of relevant functionals for this procedure, notably the number of rounds T (M) until all persons among 1,. .. , M , except the first one, have left (as M → ∞). For example, we show that the sequence (T (M) − log * M) M ∈N , where log * denotes the iterated logarithm, is tight, and study its weak subsequential limits. We further provide an appropriate and apparently new kind of normalization (based on tetrations) such that the original labels of persons who stay in the game until round n converge (as n → ∞) to some random non-Poissonian point process and study its properties. The results are applied to describe all subsequential distributional limits for the number of collisions in the Poisson-Dirichlet coalescent, thus providing a complete answer to the open problem mentioned above.
Deterministic Leader Election Takes Θ(D + n) Bit Rounds
2018
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called , for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size O( n), where n is the number of processors. It elects a leader in O(D + n) rounds, where D is the diameter of the network, with messages of size O(1). Thus it has a bit round complexity of O(D + n). This substantially improves upon the best known algorithm whose bit round complexity is O(D n). In fact, using the lower bound by Kutten et al. (2015) and a result of Dinitz and Solomon (2007), we show that the bit round complexity of is optimal (up to a constant factor), which is a significant step forward in understanding the interplay between time and message optimality for the election problem. Our algorithm requires no knowledge on the graph such as n or D, and the pipelining technique we introduce to break the O...
Deterministic Leader Election in $$O(D+\log n)$$ Time with Messages of Size O(1)
Lecture Notes in Computer Science, 2016
This paper presents a distributed algorithm, called ST T , for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size O(log n), where n is the number of processors. It elects a leader in O(D + log n) rounds, where D is the diameter of the network, with messages of size O(1). Thus it has a bit round complexity of O(D + log n). This substantially improves upon the best known algorithm whose bit round complexity is O(D log n). In fact, using the lower bound by Kutten et al. [13] and a result of Dinitz and Solomon [8], we show that the bit round complexity of ST T is optimal (up to a constant factor), which is a step forward in understanding the interplay between time and message optimality for the election problem. Our algorithm requires no knowledge on the graph such as n or D.
On the approximability of Dodgson and Young elections
ACM-SIAM Symposium on Discrete Algorithms, 2009
The voting rules proposed by Dodgson and Young are both designed to find the alternative closest to being a Condorcet winner, according to two different notions of proximity; the score of a given alternative is known to be hard to compute under either rule. In this paper, we put forward two algorithms for approximating the Dodgson score: an LP- based
Leader Election Requires Logarithmic Time in Population Protocols
Parallel Processing Letters
This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.
Logarithmic Expected-Time Leader Election in Population Protocol Model
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that m ≥ log 2 n and m = O(log n), this protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.
Related papers
Leader election using random walks
Latin American Journal of Probability and Mathematical Statistics
In the classical leader election procedure all players toss coins independently and those who get tails leave the game, while those who get heads move to the next round where the procedure is repeated. We investigate a generalizion of this procedure in which the labels (positions) of the players who remain in the game are determined using an integer-valued random walk. We study the asymptotics of some relevant quantities for this model such as: the positions of the persons who remained after n rounds; the total number of rounds until all the persons among 1, 2,. .. , M leave the game; and the number of players among 1, 2,. .. , M who survived the first n rounds. Our results lead to some interesting connection with Galton-Watson branching processes and with the solutions of certain stochastic-fixed point equations arising in the context of the stability of point processes under thinning. We describe the set of solutions to these equations and thus provide a characterization of one-dimensional point processes that are stable with respect to thinning by integer-valued random walks.
Perfect Information Leader Election in log*n+O(1) Rounds
Journal of Computer and System Sciences, 2001
In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Within a round, they may also wait to see the inputs of the good players. A protocol is called resilient if a good leader is elected with probability bounded away from 0. We give a simple, constructive leader election protocol that is resilient against coalitions of size βn, for any β < 1=2. Our protocol takes log n + O(1) rounds, each player sending at most log n bits per round. For any constant k, our protocol can be modified to take k rounds and be resilient against coalitions of size εn=(log (k) n) 3 , where ε is a small enough constant and log (k) denotes the logarithm iterated k times. This is constructive for k 3.
From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
Journal of Applied Probability
A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.
Randomized Leader Election
We present an efficient randomized algorithm for leader election in large-scale distributed systems. The proposed algorithm is optimal in message complexity (O(n) for a set of n total processes), has round complexity logarithmic in the number of processes in the system, and provides high probabilistic guarantees on the election of a unique leader. The algorithm relies on a balls and bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabilistic quorums are used to determine a winner in the second phase. We discuss, in detail, the synchronous version of the algorithm, provide extensions to an asynchronous version and examine the impact of failures.
Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time
2018
We present a fast loosely-stabilizing leader election protocol in the population protocol model. It elects a unique leader in a poly-logarithmic time and holds the leader for a polynomial time with arbitrarily large degree in terms of parallel time, i.e, the number of steps per the population size. 2012 ACM Subject Classification Theory of computation → Self-organization
Loosely-stabilizing leader election with polylogarithmic convergence time
Theoretical Computer Science, 2019
A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the population protocol model is presented in this paper. In the population protocol model, which is a common abstract model of mobile sensor networks, it is known to be impossible to design a self-stabilizing leader election protocol. Thus, in our prior work, we introduced the concept of loose-stabilization, which is weaker than self-stabilization but has similar advantage as selfstabilization in practice. Following this work, several loosely-stabilizing leader election protocols are presented. The loosely-stabilizing leader election guarantees that, starting from an arbitrary configuration, the system reaches a safe configuration with a single leader within a relatively short time, and keeps the unique leader for an sufficiently long time thereafter. The convergence times of all the existing loosely-stabilizing protocols, i.e., the expected time to reach a safe configuration, are polynomial in n where n is the number of nodes (while the holding times to keep the unique leader are exponential in n). In this paper, a loosely-stabilizing protocol with polylogarithmic convergence time is presented. Its holding time is not exponential, but arbitrarily large polynomial in n.
Deterministic Leader Election Takes Θ(D + log n) Bit Rounds
2020
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called ST T , for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size O(logn), where n is the number of processors. It elects a leader in O(D + logn) rounds, where D is the diameter of the network, with messages of size O(1). Thus it has a bit round complexity of O(D + logn). This substantially improves upon the best known algorithm whose bit round complexity is O(D logn). In fact, using the lower bound by Kutten et al. (2015) and a result of Dinitz and Solomon (2007), we show that the bit round complexity of ST T is optimal (up to a constant factor), which is a significant step forward in understanding the interplay between time and message optimality for the election problem. Our algorithm requires no knowledge on the graph such as n or D, and the pipelining technique we int...
Robust Leader Election in a Fast-Changing World
We consider the problem of electing a leader among nodes in a highly dynamic network where the adversary has unbounded capacity to insert and remove nodes (including the leader) from the network and change connectivity at will. We present a randomized algorithm that (re)elects a leader in O(D log n) rounds with high probability, where D is a bound on the dynamic diameter of the network and n is the maximum number of nodes in the network at any point in time. We assume a model of broadcast-based communication where a node can send only 1 message of O(log n) bits per round and is not aware of the receivers in advance. Thus, our results also apply to mobile wireless adhoc networks, improving over the optimal (for deterministic algorithms) O(Dn) solution presented at FOMC 2011. We show that our algorithm is optimal by proving that any randomized Las Vegas algorithm takes at least Ω(D log n) rounds to elect a leader with high probability, which shows that our algorithm yields the best possible (up to constants) termination time.
Deterministic Leader Election Takes $$\Theta (D + \log n)$$Θ(D+logn) Bit Rounds
Algorithmica
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called ST T , for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size O(log n), where n is the number of processors. It elects a leader in O(D + log n) rounds, where D is the diameter of the network, with messages of size O(1). Thus it has a bit round complexity of O(D + log n). This substantially improves upon the best known algorithm whose bit round complexity is O(D log n). In fact, using the lower bound by Kutten et al. (2015) and a result of Dinitz and Solomon (2007), we show that the bit round complexity of ST T is optimal (up to a constant factor), which is a significant step forward in understanding the interplay between time and message optimality for the election problem. Our algorithm requires no knowledge on the graph such as n or D, and the pipelining technique we introduce to break the O(D log n) barrier is general. This research has been partially supported by ANR projects DESCARTES and ESTATE (resp. ANR-16-CE40-0023 and ANR-16-CE25-0009-03). A preliminary subset of this work appeared in the proceedings of DISC 2016 [12].
The Complexity of Leader Election
International Conference of Distributed Computing and Networking, 2018
Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. [JACM 2015] showed a fundamental lower bound of Ω(m) (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability; this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., diameter 1), Kutten et al. [TCS 2015] established a tight bound ofΘ(√ n) 1 on the message complexity of randomized leader election (n is the number of nodes in the network). For graphs of diameter two, the complexity was not known. In this paper, we settle this complexity by showing a tight bound ofΘ(n) on the message complexity of leader election in diametertwo networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability (i.e., probability at least 1 − n −c , for some positive constant c) succeeds and uses O (n log 3 n) messages and runs in O (1) rounds; this algorithm works without knowledge of n (and hence needs no global knowledge). We then show that any algorithm (even Monte Carlo randomized algorithms with large enough constant success probability) needs Ω(n) messages (even when n is known), regardless of the number of rounds. We also present an O (n log n) messages deterministic algorithm that takes O (log n) rounds (but needs knowledge of n); we show that this message complexity is tight for deterministic algorithms. Our results show that leader election can be solved in diametertwo graphs in (essentially) linear (in n) message complexity and thus the Ω(m) lower bound does not apply to diameter-two graphs. Together with the two previous results of Kutten et al., our results fully characterize the message complexity of leader election vis-à-vis the graph diameter.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.