Abstract
This paper considers the leader election problem (LEP) in asynchronous complete networks with undetectable fail-stop failures. Especially, it is discussed whether presence of a global sense of direction affects the message complexity of LEP in faulty networks. For a complete network of n processors where k processors start the algorithm spontaneously and at most fp (
Cite
CITATION STYLE
Masuzawa, T., Nishikawa, N., Hagihara, K., & Tokura, N. (1989). Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 392 LNCS, pp. 171–182). Springer Verlag. https://doi.org/10.1007/3-540-51687-5_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
