Self-Stabilizing Leader Election in Dynamic Networks

Two silent self-stabilizing asynchronous distributed algorithms are given for the leader election problem in a dynamic network with unique IDs. A leader is elected for each connected component of the network. A BFS DAG, rooted at the leader, is constructed in each component. The construction takes O...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2018-07, Vol.62 (5), p.977-1047
Hauptverfasser:	Datta, Ajoy K., Larmore, Lawrence L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer Science Distributed processing Dithering Dynamical systems Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!