Skip to main content
Conference Proceedings

Time and message optimal leader election in asynchronous oriented complete networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1893 314-322
DOI: 10.1007/3-540-44612-5_27
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of leader election in asynchronous oriented N-node complete networks. We present a leader election algorithm with O(N) message and O (log log N) time complexity. The message complexity is optimal and the time complexity is the best possible under the assumption of message optimality. The best previous leader election algorithm for asynchronous oriented complete networks by Singh [16] achieves O(N) message and O (log N) time complexity.

Cite

CITATION STYLE

APA

Dobrev, S. (2000). Time and message optimal leader election in asynchronous oriented complete networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1893, pp. 314–322). Springer Verlag. https://doi.org/10.1007/3-540-44612-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free