Abstract
The problem of leader election in distributed systems is considered. Components communicate by means of buffered broadcasting as opposed to usual point-to-point communication. In this paper three leader election protocols of increasing maturity are specified. We start with a simple leader election protocol, where an initial leader is present. In the second protocol this assumption is dropped. Eventually a fault-tolerant protocol is constructed, where components may crash and revive spontaneously.
Both the protocols and the required behaviour are formally specified in ACP. Some remarks are made about a formal verification of the protocols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.H. Abu-Amara. Fault-tolerant distributed algorithm for election in complete networks. IEEE Transactions on Computers, 37(4):449–453, 1988.
Y. Afek and E. Gafni. Time and message bounds for election in synchronous and asynchronous complete networks. SIAM Journal on Computing, 20(2):376–394, 1991.
H. Attiya, J. van Leeuwen, N. Santoro, and S. Zaks. Efficient elections in chordal ring networks. Algorithmica, 4(3):437–446, 1989.
J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3(2): 142–188, 1991.
M.A. Bezem and J.F. Groote. A correctness proof of a One-bit Sliding Window Protocol in μCRL. Technical Report Logic Group Preprint Series nr. 99, Department of Philosophy, Utrecht University, 1993.
M.A. Bezem and J.F. Groote. Invariants in process algebra with data. Technical Report Logic Group Preprint Series nr. 98, Department of Philosophy, Utrecht University, 1993.
J.J. Brunekreef. Process Specification in a UNITY Format. Technical Report P9329, Programming Research Group, University of Amsterdam, 1993. An exented abstract is published in this volume.
J.J. Brunekreef, J.P. Katoen, R.L.C. Koymans, and S. Mauw. Design and analysis of dynamic leader election protocols in broadcast networks. Technical Report P9324, Programming Research Group, University of Amsterdam, 1993.
E. Chang and R. Roberts. An improved algorithm for decentralized extrema-finding in circular configurations of processors. Communications of the ACM, 22(5):281–283, 1979.
S. Dolev, A. Israeli, and S. Moran. Uniform dynamic self-stabilizing leader election part 1: Complete graph protocols. (Preliminary version appeared in Proc. 6th Int. Workshop on Distributed Algorithms, (S. Toueg et. al., eds.), LNCS 579, 167–180, 1992), 1993.
M.J. Fischer. A theoretican’s view of fault tolerant distributed computing. In Fault Tolerant Distributed Computing, number 448 in LNCS, pages 1–9. Springer Verlag, 1991.
J.F. Groote and A. Ponse. μCRL: A base for analyzing processes with data. In E. Best and G. Rozenberg, editors, Proceedings of the 3 rd Workshop on Concurrency and Compositionality, pages 125–130. Universität Hildesheim, 1991.
R. Gusella and S. Zatti. An election algorithm for a distributed clock synchronization program. In Proc. 6th IEEE Int. Conf. on Distributed Computing Systems, pages 364–371, 1986.
A. Itai, S. Kutten, Y. Wolfstahl, and S. Zaks. Optimal distributed t-resilient election in complete networks. IEEE Transactions on Software Engineering, 16(4):415–420, 1990.
E. Korach, S. Moran, and S. Zaks. Tight lower and upper bounds for some distributed algorithms for a complete network of processors. In Proc. 3rd Annual ACM Symp. on Principles of Distributed Computing, pages 199–207. ACM, 1984.
G. LeLann. Distributed systems-towards a formal approach. In B. Gilchrist, editor, Information Processing (vol. 77) (IFIP), pages 155–160. North-Holland, Amsterdam, 1977.
M.C. Loui, T.A. Matsushita, and D.B. West. Election in a complete network with a sense of direction. Information Processing Letters, 22:185–187, 1986. (see also Inf. Proc. Letters, 28:327, 1988).
T. Masuzawa, N. Nishikawa, K. Hagihara, and N. Tokura. Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction. In J.-C. Bermond and M. Raynal, editors, Distributed Algorithms, LNCS 392, pages 171–182. Springer-Verlag, 1989.
S. Mauw and G.J. Veltink. A Process Specification Formalism. Fund. Inf., XII:85–139, 1990.
G.L. Peterson. An O(n logn) unidirectional algorithm for the circular extrema problem. ACM Trans. Progr. Lang. Syst., 4:758–762, 1982.
L. Shrira and O. Goldreich. Electing a leader in a ring with link failures. Acta Informatica, 24:79–91, 1987.
G. Singh. Efficient distributed algorithms for leader election in complete networks. In Proc. 11th IEEE Int. Conf. on Distributed Computing Systems, pages 472–479, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Brunekreef, J., Katoen, JP., Koymans, R., Mauw, S. (1995). Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks. In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds) Algebra of Communicating Processes. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-2120-6_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2120-6_15
Publisher Name: Springer, London
Print ISBN: 978-3-540-19909-0
Online ISBN: 978-1-4471-2120-6
eBook Packages: Springer Book Archive