Distributed election in complete networks

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1988 China (People's Republic of) English Publisher:Springer Science and Business Media LLCJournal:Distributed Computing, volume 3, pages 19-22 (issn: 0178-2770, eissn: 1432-0452,

Copyright policy )

Authors: Chan, MY; Chin, FYL;

doi: 10.1007/bf01788564

handle: 10722/152352

Distributed election in complete networks

- Summary
- Subjects
- Metrics

Abstract

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.

Country

China (People's Republic of)

Related Organizations

University of Hong Kong
China (People's Republic of)
The University of Texas at Dallas
United States
University of Hong Kong (香港大學)
China (People's Republic of)

Keywords

complete networks, Expected Message Complexity, Theory of software, expected message complexity, Distributed Election Algorithms, Analysis of algorithms and problem complexity, Asynchronous Complete Networks, distributed election, Synchronous Complete Networks

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average