Design and analysis of dynamic leader election protocols in broadcast networks

DOI10.1007/s004460050017zbMath1448.68077OpenAlexW2118570620MaRDI QIDQ5137017

Sjouke Mauw, Ron Koymans, Jacob Brunekreef, 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

verificationtemporal logicfinite-state machinesleader electioncommunication protocolsmessage complexitybroadcast networkprotocol design, specification

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant broadcasts
• Electing a leader in a ring with link failures
• Efficient elections in chordal ring networks
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Fault-tolerant distributed algorithm for election in complete networks
• Specifying Concurrent Program Modules
• On the minimal synchronism needed for distributed consensus
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• Process Algebra
• Temporal logic and applications—a tutorial
• Self-stabilizing systems in spite of distributed control
• An improved algorithm for decentralized extrema-finding in circular configurations of processes

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