leader election algorithm
Recently Published Documents


TOTAL DOCUMENTS

91
(FIVE YEARS 7)

H-INDEX

9
(FIVE YEARS 0)

2021 ◽  
Vol 68 (2) ◽  
pp. 1-22
Author(s):  
Artur Czumaj ◽  
Peter Davies

We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D , randomized broadcasting requires Ω( D log n / D + log 2 n ) rounds, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be improved for the model with spontaneous transmissions, providing an O ( D log n log log n /log D + log O (1) n )-time broadcasting algorithm. In this article, we give a new and faster algorithm that completes broadcasting in O ( D log n /log D + log O (1) n ) time, succeeding with high probability. This yields the first optimal O ( D )-time broadcasting algorithm whenever n is polynomial in D . Furthermore, our approach can be applied to design a new leader election algorithm that matches the performance of our broadcasting algorithm. Previously, all fast randomized leader election algorithms have used broadcasting as a subroutine and their complexity has been asymptotically strictly larger than the complexity of broadcasting. In particular, the fastest previously known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013) requires O ( D log n / D min {log log n , log n / D } + log O (1) n )-time, succeeding with high probability. Our new algorithm again requires O ( D log n /log D + log O (1) n ) time, also succeeding with high probability.


Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 869
Author(s):  
Nguyen Dinh Nguyen ◽  
Taehong Kim

Container-based virtualization is becoming a de facto way to build and deploy applications because of its simplicity and convenience. Kubernetes is a well-known open-source project that provides an orchestration platform for containerized applications. An application in Kubernetes can contain multiple replicas to achieve high scalability and availability. Stateless applications have no requirement for persistent storage; however, stateful applications require persistent storage for each replica. Therefore, stateful applications usually require a strong consistency of data among replicas. To achieve this, the application often relies on a leader, which is responsible for maintaining consistency and coordinating tasks among replicas. This leads to a problem that the leader often has heavy loads due to its inherent design. In a Kubernetes cluster, having the leaders of multiple applications concentrated in a specific node may become a bottleneck within the system. In this paper, we propose a leader election algorithm that overcomes the bottleneck problem by evenly distributing the leaders throughout nodes in the cluster. We also conduct experiments to prove the correctness and effectiveness of our leader election algorithm compared with a default algorithm in Kubernetes.


2021 ◽  
Vol 68 (2) ◽  
pp. 2469-2486
Author(s):  
Samira Kanwal ◽  
Zeshan Iqbal ◽  
Aun Irtaza ◽  
Rashid Ali ◽  
Kamran Siddique

Author(s):  
Arnaud Favier ◽  
Nicolas Guittonneau ◽  
Luciana Arantes ◽  
Anne Fladenmuller ◽  
Jonathan Lejeune ◽  
...  

Author(s):  
Nabil Kadjouh ◽  
Ahcène Bounceur ◽  
Madani Bezoui ◽  
Mohamed Essaid Khanouche ◽  
Reinhardt Euler ◽  
...  

2020 ◽  
Vol 77 (1) ◽  
pp. 751-779
Author(s):  
Amit Biswas ◽  
Ashish Kumar Maurya ◽  
Anil Kumar Tripathi ◽  
Samir Aknine

Sign in / Sign up

Export Citation Format

Share Document