DeepAI AI Chat
Log In Sign Up

Singularly Near Optimal Leader Election in Asynchronous Networks

by   Shay Kutten, et al.

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 asynchronous networks. Kutten et al. (JACM 2015) presented a singularly near optimal randomized leader election algorithm for general synchronous networks that ran in O(D) time and used O(m log n) messages (where D, m, and n are the network's diameter, number of edges and number of nodes, respectively) with high probability.[Throughout, "with high probability" means "with probability at least 1-1/n^c, for constant c."] Both bounds are near optimal (up to a logarithmic factor), since Ω(D) and Ω(m) are the respective lower bounds for time and messages for leader election even for synchronous networks and even for (Monte-Carlo) randomized algorithms. On the other hand, for general asynchronous networks, leader election algorithms are only known that are either time or message optimal, but not both. Kutten et al. (DISC 2020) presented a randomized asynchronous leader election algorithm that is singularly near optimal for complete networks, but left open the problem for general networks. This paper shows that singularly near optimal (up to polylogarithmic factors) bounds can be achieved for general asynchronous networks. We present a randomized singularly near optimal leader election algorithm that runs in O(D + log^2n) time and O(mlog^2 n) messages with high probability. Our result is the first known distributed leader election algorithm for asynchronous networks that is near optimal with respect to both time and message complexity and improves over a long line of results including the classical results of Gallager et al. (ACM TOPLAS, 1983), Peleg (JPDC, 1989), and Awerbuch (STOC 89).


page 3

page 5

page 7

page 9

page 11

page 13

page 15

page 17


An Almost Singularly Optimal Asynchronous Distributed MST Algorithm

A singularly (near) optimal distributed algorithm is one that is (near) ...

Singularly Optimal Randomized Leader Election

This paper concerns designing distributed algorithms that are singularly...

The Complexity of Leader Election: A Chasm at Diameter Two

This paper focuses on studying the message complexity of implicit leader...

Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election

We consider the energy complexity of the leader election problem in the ...

Improved Deterministic Leader Election in Diameter-Two Networks

In this paper, we investigate the leader election problem in diameter-tw...

Improved Tradeoffs for Leader Election

We consider leader election in clique networks, where n nodes are connec...

Selecting a Leader in a Network of Finite State Machines

This paper studies a variant of the leader election problem under the st...