research-article

Design and analysis of dynamic leader election protocols in broadcast networks

Authors:

Jacob Brunekreef,

Joost-Pieter Katoen,

Ron Koymans, and

Sjouke MauwAuthors Info & Claims

Distributed Computing, Volume 9, Issue 4

Pages 157 - 171

https://doi.org/10.1007/s004460050017

Published: 01 February 1996 Publication History

Summary

The well-known problem of leader election in distributed systems is considered in a dynamic context where processes may participate and crash spontaneously. Processes communicate by means of buffered broadcasting as opposed to usual point-to-point communication. In this paper we design a leader election protocol in such a dynamic context. As the problem at hand is considerably complex we develop the protocol in three steps. In the initial design processes are considered to be perfect and a leader is assumed to be present initially. In the second protocol, the assumption of an initial leader is dropped. This leads to a symmetric protocol which uses an (abstract) timeout mechanism to detect the absence of a leader. Finally, in the last step of the design processes may crash without giving any notification of other processes. The worst case message complexity of all protocols is addressed. A formal approach to the specification and verification of the leader election protocols is adopted. The requirements are specified in a property-oriented way and the protocols are denoted by means of extended finite state machines. It is proven using linear-time temporal logic that the fault-tolerant protocol satisfies its requirements.

References

[1]

Abu-Amara HH Fault-tolerant distributed algorithm for election in complete networks IEEE Trans Comput 1988 37 449-453

[2]

Afek Y and Gafni E Time and message bounds for election in synchronous and asynchronous complete networks SIAM J Comput 1991 20 376-394

[3]

Attiya H van Leeuwen J Constructing efficient election algorithms from efficient traversal algorithms Distributed algorithms. Lect Notes Comput Sci 1987 Berlin Heidelberg New York Springer 337-344

[4]

Attiya H, van Leeuwen J, Santoro N, and Zaks S Efficient elections in chordal ring networks Algorithmica 1989 4 437-446

[5]

Baeten JCM, Weijland WP: Process algebra. Cambridge Tracts in Theoretical Computer Science, vol 18, Cambridge University Press 1990

[6]

von Bochmann G Finite state description of communication protocols Comput Networks 1978 2 361-372

[7]

Brunekreef JJ On modular algebraic protocol specification 1995 The Netherlands University of Amsterdam

[8]

Brunekreef JJ, Katoen J-P, Koymans RLC, and Mauw S Design and analysis of dynamic leader election protocols in broadcast networks 1993 The Netherlands Department of Computer Science, University of Twente

[9]

Brunekreef JJ, Katoen J-P, Koymans RLC, and Mauw S Ponse A, Verhoef C, and van Vlijmen SFM Algebraic specification of dynamic leader election protocols in broadcast networks Algebra of communicating processes. Workshops in Computing 1994 Berlin Heidelberg New York Springer 338-357

[10]

Budkowski S and Dembinski P An introduction to Estelle: a specification language for distributed systems Comput Networks ISDN Syst 1987 14 3-23

[11]

Chang E and Roberts R An improved algorithm for decentralized extrema-finding in circular configurations of processors Commun ACM 1979 22 281-283

[12]

Dolev S Schiper A Optimal time self stabilization in dynamic systems Distributed algorithms. Lect Notes Comput Sci 1993 Berlin Heidelberg New York Springer 160-173

[13]

Dolev S, Israeli A, Moran S, et al. Toueg S et al. Uniform dynamic self-stabilizing leader election Distributed algorithms. Lect Notes Comput Sci 1992 Berlin Heidelberg New York Springer 167-180

[14]

Dolev D, Dwork C, and Stockmeyer L On the minimal synchronism needed for distributed consensus J ACM 1987 34 77-97

[15]

Dijkstra EW Self-stabilizing systems in spite of distributed control Commun ACM 1974 17 634-644

[16]

Fisher MJ Simons B and Spector A A theoretician’s view of fault-tolerant distributed computing Fault-tolerant distributed computing. Lect Notes Comput Sci 1991 Berlin Heidelberg New York Springer 1-9

[17]

Gehani NH Broadcasting sequential processes IEEE Trans Softw Eng 1984 10 343-351

[18]

Gotzhein R Temporal logic and its applications — a tutorial Comput Networks ISDN Syst 1992 24 203-218

[19]

Gouda MG Protocol verification made simple: a tutorial Comput Networks ISDN Syst 1993 25 969-980

[20]

Gusella R, Zatti S: An election algorithm for a distributed clock synchronization program. In: Proc 6th IEEE Int Conf on Distributed Computing Systems (1986), pp 364–371

[21]

Hailpern BT and Owicki SS Modular verification of computer communication protocols IEEE Trans Commun 1983 31 56-68

[22]

Hoare CAR Communicating sequential processes 1985 Englewood Cliffs Prentice-Hall

[23]

Itai A, Kutten S, Wolfstahl Y, and Zaks S Optimal distributed r-resilient election in complete networks IEEE Trans Softw Eng 1990 16 415-420

[24]

King C-T, Gendreau TB, and Ni LM Reliable election in broadcast networks J Parallel Distrib Comput 1989 7 521-540

[25]

Korach E, Kutten S, and Moran S A modular technique for the design of efficient distributed leader finding algorithms ACM Trans Prog Lang Syst 1990 12 84-101

[26]

Korach E, Moran S, Zaks S: Tight lower and upper bounds for some distributed algorithms for a complete network of processors. In: Proc ACM Symp Principles Distributed Comput (1984), pp 199–207

[27]

Koymans RLC et al. Banieqbal B et al. Specifying message passing systems requires extending temporal logic Proc Colloquium on Temporal Logic and Specification. Lect Notes Comput Sci 1989 Berlin Heidelberg New York Springer 213-223

[28]

Lamport L Specifying concurrent program modules ACM Trans Prog Lang Syst 1983 5 190-222

[29]

Larsen KG, Thomsen B: A modal process logic. In: Proc IEEE Symposium on Logic in Computer Science (1988), pp 203–210

[30]

van Leeuwen J and Tan RB An improved upperbound for distributed election in bidirectional rings of processors Distrib Comput 1987 2 149-160

[31]

LeLann G Gilchrist B Distributed systems — towards a formal approach Information Processing (vol. 77) (IFIP) 1977 Amsterdam North-Holland 155-160

[32]

Loui MC, Matsushita TA, and West DB Election in a complete network with a sense of direction Inf Process Lett 1986 22 185-187

[33]

Manna Z and Pnueli A The temporal logic of reactive and concurrent systems — Specification 1992 Berlin Heidelberg New York Springer

[34]

Masuzawa T, Nishikawa N, Tokura K., and Hagihara N Bermond J-C and Raynal M Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction Distributed algorithms. Lect Notes Comput Sci 1989 Berlin Heidelberg New York Springer 171-182

[35]

Mauw S and Veltink G A process specification formalism Fund Inf 1990 VIII 85-139

[36]

Melliar-Smith PM, Moser LE, and Agrawala V Broadcast protocols for distributed systems IEEE Trans Parallel Distrib Syst 1990 1 17-25

[37]

Peterson GL An O(nlogn) unidirectional algorithm for the circular extrema problem ACM Trans Program Lang Syst 1982 4 758-762

[38]

Schneider M Self-stabilization ACM Comput Surv 1993 25 45-67

[39]

Schneider FB, Gries D, and Schlichting RD Fault-tolerant broadcasts Sci Comput Program 1984 4 1-16

[40]

Shasha DE, Pnueli A, Ewald W: Temporal verification of carrier-sense local area network protocols. In: Proc ACM Symposium on Principles of Programming Languages (1984), pp 54–65

[41]

Shrira L and Goldreich O Electing a leader in a ring with link failures Acta Inf 1989 24 79-91

[42]

Singh G: Efficient distributed algorithms for leader election in complete networks. In: Proc 11th IEEE Int Conf on Distributed Computing Systems (1991), pp 472–479

Cited By

Bounceur A(2023)A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use CaseProceedings of the 7th International Conference on Future Networks and Distributed Systems10.1145/3644713.3644740(212-216)Online publication date: 21-Dec-2023
https://dl.acm.org/doi/10.1145/3644713.3644740
Gilbert SRobinson PSourav S(2022)Leader Election in Well-Connected GraphsAlgorithmica10.1007/s00453-022-01068-x85:4(1029-1066)Online publication date: 24-Nov-2022
https://dl.acm.org/doi/10.1007/s00453-022-01068-x
Haque MBaroudi U(2021)Ambient self-powered cluster-based wireless sensor networks for industry 4.0 applicationsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-020-05259-y25:3(1859-1884)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1007/s00500-020-05259-y
Show More Cited By

Index Terms

Design and analysis of dynamic leader election protocols in broadcast networks

Index terms have been assigned to the content through auto-classification.

Recommendations

Uniform Leader Election Protocols for Radio Networks

A radio network is a distributed system with no central arbiter, consisting of n radio transceivers, henceforth referred to as stations. We assume that the stations are identical and cannot be distinguished by serial or manufacturing number. The leader ...
Read More
Time-Optimal Self-Stabilizing Leader Election in Population Protocols
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. The self-stabilizing leader election problem requires the protocol to converge on a ...
Read More
Near-Optimal Leader Election in Population Protocols on Graphs
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Distributed Computing

Distributed Computing Volume 9, Issue 4

Feb 1996

45 pages

ISSN:0178-2770

Issue’s Table of Contents

© Springer-Verlag 1996.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 February 1996

Accepted: 15 September 1995

Received: 15 September 1993

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Bounceur A(2023)A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use CaseProceedings of the 7th International Conference on Future Networks and Distributed Systems10.1145/3644713.3644740(212-216)Online publication date: 21-Dec-2023
https://dl.acm.org/doi/10.1145/3644713.3644740
Gilbert SRobinson PSourav S(2022)Leader Election in Well-Connected GraphsAlgorithmica10.1007/s00453-022-01068-x85:4(1029-1066)Online publication date: 24-Nov-2022
https://dl.acm.org/doi/10.1007/s00453-022-01068-x
Haque MBaroudi U(2021)Ambient self-powered cluster-based wireless sensor networks for industry 4.0 applicationsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-020-05259-y25:3(1859-1884)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1007/s00500-020-05259-y
Gilbert SRobinson PSourav SNewport CKeidar I(2018)Leader Election in Well-Connected GraphsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212754(227-236)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212754
Park SYoo SKim B(2018)An election protocol based on group membership detection algorithm in mobile ad hoc distributed systemsThe Journal of Supercomputing10.1007/s11227-018-2258-074:5(2239-2253)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s11227-018-2258-0
Datta ALarmore L(2018)Self-Stabilizing Leader Election in Dynamic NetworksTheory of Computing Systems10.1007/s00224-017-9758-962:5(977-1047)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00224-017-9758-9
Ingram RRadeva TShields PViqar SWalter JWelch J(2013)A leader election algorithm for dynamic networks with causal clocksDistributed Computing10.1007/s00446-013-0184-126:2(75-97)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1007/s00446-013-0184-1
Yue HKatoen J(2010)Leader election in anonymous radio networksProceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications10.5555/1883941.1883964(247-261)Online publication date: 14-Jun-2010
https://dl.acm.org/doi/10.5555/1883941.1883964
Chung HRobinson PWelch JRicha AMoscibroda T(2010)Regional consecutive leader election in mobile ad-hoc networksProceedings of the 6th International Workshop on Foundations of Mobile Computing10.1145/1860684.1860701(81-90)Online publication date: 16-Sep-2010
https://dl.acm.org/doi/10.1145/1860684.1860701
Boukerche AAbrougui KOnoe SGuizani MChen HSawahashi M(2006)An efficient leader election protocol for mobile networksProceedings of the 2006 international conference on Wireless communications and mobile computing10.1145/1143549.1143775(1129-1134)Online publication date: 3-Jul-2006
https://dl.acm.org/doi/10.1145/1143549.1143775
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents