In this paper, we present a randomized leader elec-tion algorithm (primarily non fault-tolerant) that is op-timal in terms of message complexity (O(n) for a dis-tributed system with n processes), has round complex-ity logarithmic in n, and is correct with high probability (w.h.p.).

In this paper, we propose three algorithms for leader election: one deterministic and two randomized. The deterministic algo-rithm executes for at most 2N +. is the size of the label space used to assign unique labels to the nodes.

Mar 7, 2007 · 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.

Aug 6, 2020 · Our main result is a randomized distributed leader election algorithm for asynchronous complete networks that is essentially (up to a polylogarithmic factor) singularly optimal. Our algorithm uses messages with high probability and runs in time (with high probability) to elect a unique leader.

Mar 23, 2007 · 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...

Singularnearoptimalityfollows from the fact that Ω(D) and Ω(m) are lower bounds for time and messages for leader election even for synchronous networks and even for randomized algorithms [30].

A randomized leader election algorithm that is opti-mal in the number of messages O(n), has round com-plexity logarithmic in the number of processes in the system O(log n), and elects a unique leader w.h.p.

Oct 7, 2020 · This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks.

The elimination process described above provides the foundation for an effi- cient randomized distributed algorithm for leader election in a computer net- work.

Aug 4, 2021 · This paper shows that singularly near optimal (up to polylogarithmic factors) bounds can be achieved for general {\em asynchronous} networks. We present a randomized singularly near optimal leader election algorithm that runs in O(D +log2 n) time and O(mlog2 n) messages with high probability.