Design and analysis of dynamic leader election protocols in broadcast networks

DOI10.1007/S004460050017MaRDI QIDQ5137017zbMATH OpenOpenAlexFDO

Authors Jacob Brunekreef, Ron Koymans, Sjouke Mauw, Joost-Pieter Katoen

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/22a32ad8-2c3a-49f6-948a-a06f1dc418fc

zbMATH Keywords

verificationleader electiontemporal logiccommunication protocolsmessage complexityfinite-state machinesbroadcast networkprotocol design, specification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Probabilistic verification of hierarchical leader election protocol in dynamic systems
• Self-stabilizing leader election in dynamic networks
• A distributed election protocol for unreliable networks
• Leader election in complete networks
• Leader election in the presence of n-1 initial failures

Cites work

• scientific article; zbMATH DE number 4157900 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4050991 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• Efficient elections in chordal ring networks
• Electing a leader in a ring with link failures
• Fault-tolerant broadcasts
• Fault-tolerant distributed algorithm for election in complete networks
• On the minimal synchronism needed for distributed consensus
• Process Algebra
• Self-stabilizing systems in spite of distributed control
• Specifying Concurrent Program Modules
• Temporal logic and applications—a tutorial
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

Cited in

(5)

• Leader election in well-connected graphs
• Self-stabilizing leader election in dynamic networks
• Formal verification of a leader election protocol in process algebra
• A leader election algorithm for dynamic networks with causal clocks
• Probabilistic verification of hierarchical leader election protocol in dynamic systems

This page was built for publication: Design and analysis of dynamic leader election protocols in broadcast networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137017)