Distributed election in complete networks

DOI10.1007/BF01788564MaRDI QIDQ1112606zbMATH OpenFDO

Authors Mee Yee Chan, Francis Y. L. Chin

Publication date 1988

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01788564

zbMATH Keywords

complete networksdistributed electionexpected message complexity

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25)

Review text

An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and an O(n) expected message complexity is shown.

Cites work

• Lower Bounds for Distributed Maximum-Finding Algorithms
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks

Cited in

(5)

• Distributed election in a circle without a global sense of orientation
• A distributed voting scheme to maximize preferences
• How to assign votes in a distributed system
• The Power of Two Choices in Distributed Voting
• Leader election in complete networks

This page was built for publication: Distributed election in complete networks

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