Talk:Leader election

Merger proposal

I propose that Leader election be merged into Distributed Systems#Coordinator Election. I also think that prior to the merger, the content of this article needs to be overhauled. For example, "leader" should be changed to "coordinator" to better fit the lingo on the Distributed Systems page which repeatedly mentions "coordination" (that also conflicts with this article's title). Also note that this article is of a reasonable size and that the merging will not cause any problems as far as article size or undue weight is concerned. Dominikiii (talk) 04:25, 3 March 2013 (UTC)

I disagree. I think the problem is much more widely known in the scholarly literature as the "leader election problem" and, as such, should be known by that title. I'm not saying that Google searches are the be-all-end-all of everything, but a simple search on Google Scholar turns up about 750000 results for "leader election" vs. 48000 for "coordinator election". --Craw-daddy | T | 18:04, 6 May 2013 (UTC)

I removed this outdated merge proposal in the article, the article is too long (now) to merge into distributed systems. --Cic (talk) 20:37, 24 February 2015 (UTC)

Applications

It would be cool if someone else could write about some other applications than radio networks. I will probably extend the radio network section at some point -- but if someone else could help, it would be greatly appreciated. Good starting points are probably the books by Peleg, Lynch, etc. Thanks! Isomorphismus (talk) 20:10, 24 October 2014 (UTC)

Unoriented mesh

The cited algorithm is from a presentation pdf that lacks detailed explanations. The given algorithm is very unclear and is not capable of solving the problem in an unoriented mash. Either add more concise and detailed explanation of the algorithm(i.e. how at the end of the election cycle, only one node will be elected), or change the algorithm.

To my knowledge, the leader election algorithm in unoriented mash is only solvable when number of nodes are odd. There is no algorithm to solve this problem for "even" number of nodes. I am working on the proof and as soon as I find the proof I will have it posted here. — Preceding unsigned comment added by Pooria mdn (talk • contribs) 17:24, 4 February 2016 (UTC)

Opening Paragraph is misleading

The opening paragraph states

"Leader election algorithms are designed to be economical in terms of total bytes transmitted, and time. The algorithm suggested by Gallager, Humblet, and Spira[1] for general undirected graphs has had a strong impact on the design of distributed algorithms in general, and won the Dijkstra Prize for an influential paper in distributed computing.

Many other algorithms have been suggested for different kinds of network graphs, such as undirected rings, unidirectional rings, complete graphs, grids, directed Euler graphs, and others. A general method that decouples the issue of the graph family from the design of the leader election algorithm was suggested by Korach, Kutten, and Moran.[2]"

The use of the word "suggested" is confusing. Suggested? Has it ever been checked? Are there some cases in which it doesn't work, so that it needs to be attempted to see if it actually works? Are there cases in which we are sure it always works? The phrase "suggested" is frustrating because it makes the opening lack the commitment that its author was sure of what he or she was writing. This needs expert attention to verify whether these "suggested" algorithms ever work. Mehaveaccount (talk) 05:16, 17 October 2018 (UTC)