Random leaders and random spanning trees

Judit Bar-Ilan, Dror Zernik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations


The problem of distributively constructing a minimum spanning tree has been thoroughly studied. The root of this spanning tree is often elected as a leader, and then centralized algorithms are run in the distributed system. If, however, we have fault tolerance in mind, selecting a random spanning tree and a random leader are more desirable. If we manage to select a random tree, the probability that a bad channel will disconnect some nodes from the random tree is relatively small. Otherwise, a small number of predetermined edges will greatly effect the system's behavior. In this paper we present an algorithm for choosing a random leader (RL), and distributed random spanning tree algorithms (RST), where random means, that each spanning tree in the underlying graph has the same probability of being selected. We give optimal algorithms for the complete graph and the ring. We also describe an RST algorithm for the general graph, and discuss the relation between RST and RL algorithms.

Original languageEnglish
Title of host publicationDistributed Algorithms - 3rd International Workshop, Proceedings
EditorsJean-Claude Bermond, Michel Raynal
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540516873
StatePublished - 1989
Externally publishedYes
Event3rd International Workshop on Distributed Algorithms, WDAG 1989 - Nice, France
Duration: 26 Sep 198928 Sep 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Workshop on Distributed Algorithms, WDAG 1989

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1989.


Dive into the research topics of 'Random leaders and random spanning trees'. Together they form a unique fingerprint.

Cite this