Singularly Near Optimal Leader Election in Asynchronous Networks

This paper concerns designing distributed algorithms that are {\em singularly optimal}, i.e., algorithms that are {\em simultaneously} time and message {\em optimal}, for the fundamental leader election problem in {\em asynchronous} networks. Kutten et al. (JACM 2015) presented a singularly near opt...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-08
Hauptverfasser:	Kutten, Shay, Moses, William K, Pandurangan, Gopal, Peleg, David
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Elections Lower bounds Messages Monte Carlo simulation Networks
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!