Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Afek, Y. and Gafni, E., Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks, PODC 1985, pp 199–207.
Aho, V. A., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
Awerbuch, B., Linear Time Distributed Algorithms for Minimum Spanning Trees, leader election, counting and related problems, 19th STOC, 1987, pp. 230–240.
Broder, A. Z., Generating Random Spanning Trees, To appear in 30th FOCS, 1989.
Biggs, N., Algebraic Graph Theory
Broder, A. Z. and Karlyn, A. R., Bounds on Cover Time 29th FOCS, 1988.
Burns, J. E., A Formal Model for Message Passing Systems, TR-91, Indiana University, 1980.
Even, S., Graph Algorithms, Maryland, Computer Science Press, 1979.
Fredrickson, G. N. and Lynch N. A., The Impact of Synchronous Communication On the Problem of Electing a Leader in a Ring, STOC84, pp. 493–503.
Gafni, E., Improvements in the Time Complexity of Two Message-Optimal Election Algorithms, PODC85, pp 175–184.
Gallager, R. G., Humblet, P. A. and Spira, P. M., A Distributed Algorithm for Minimum Weight Spanning Trees, ACM Trans. Program. Lang. Syst., vol 5. pp. 66–77, January 1983.
Guenoche, A., Random Spanning Trees, J. Algorithm, vol 4, pp. 214–220, 1983.
Harary, F., Graph Theory Addison-Wesley, 1972.
Kemeny, J.G and Snell, J.L., Finite Markov Chains Lect. Notes in Math, vol 69.
Mulmuley, K., Vazirani, U. V. and Vazirani, V. J., Matching is as Easy as Matrix Inversion, 19th STOC, 1987, pp. 345–354.
Quinn, M. J. and Narsingh Deo, Parallel Graph Algorithms, Computing Surveys, vol 16. No. 3, September 1984, pp 319–348.
Vitanyi, P., Distributed Election in an Archimedian Ring of Processors, STOC84, pp 542–547.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Ilan, J., Zernik, D. (1989). Random leaders and random spanning trees. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_27
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive