Time and message optimal leader election in asynchronous oriented complete networks

DOI10.1007/3-540-44612-5_27MaRDI QIDQ4536367zbMATH OpenFDO

Authors Stefan Dobrev

Publication date 4 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_27

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Leader election in complete networks
• Leader Election in Complete Networks
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Deterministic leader election in O(D+ n) time with messages of size O(1)
• Efficient leader election using sense of direction

Cited in

(7)

• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Leader Election in Complete Networks
• Efficient leader election using sense of direction
• An efficient message passing election algorithm based on Mazurkiewicz's algorithm
• Communication-efficient leader election and consensus with limited link synchrony
• Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
• Singularly optimal randomized leader election

This page was built for publication: Time and message optimal leader election in asynchronous oriented complete networks

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