Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
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 f p (<n/2) processors are faulty, this paper shows
(1) the message complexity of LEP is Θ(n+k f p ), if the complete network has a global sense of direction.
It is already known that LEP requires Ω(n log k+k f p ) message exchanges, if the complete network has no global sense of direction. Therefore, our result implies that the message complexity of LEP can be greatly reduced by using a global sense of direction in faulty networks as well as in reliable networks. For a complete network with at most f l (<n−1) faulty links (and no faulty processor), this paper also shows the similar result:
(2) the message complexity of LEP is Θ(n+k f l +f l log f l ), if the complete network has a global sense of direction.
Unable to display preview. Download preview PDF.
- Y.Afek and E.Gafni, “Time and message bound for election in synchronous and asynchronous complete networks”, Proc. 4th PODC, Minacki, Canada, pp. 186–195 (Aug. 1985).Google Scholar
- R.Bar-Yehuda, S.Kutten, Y.Wolfstahl and S.Zaks, “Making distributed spanning tree algorithms fault-resilient”, Proc. 4th Ann. Sympo. on Theoretical Aspects of Computer Science, LNCS 247, pp.432–444 (Feb. 1987).Google Scholar
- E. Korach, S.Moran and S.Zaks, “Tight lower and upper bounds for some distributed algorithms for a complete network of processors”, Proc. 3rd PODC, Vancouver, Canada, pp.199–207 (Aug. 1984).Google Scholar
- S. Kutten, Y. Wolfstahl and S. Zaks, “Optimal distributed t-resilient election in complete networks”, Tech. Rep. #430, Computer Science Department, Technion, Israel (Aug. 1986).Google Scholar
- S. Kutten, “Optimal fault-tolerant distributed construction of a spanning tree”, (the final version of ). “Google Scholar
- T.Masuzawa, N.Nishikawa, K.Hagihara, N.Tokura and K.Fujita, “Leader election problem on faulty complete networks with global sense of direction” (in Japanese), Tech. Rep. IECEJ,COMP88-98 (Mar. 1989).Google Scholar
- N. Santoro, “Sense of direction, topological awareness and communication complexity”, ACM SIGACT NEWS, vol.16, pp.50–56 (Summer 1984).Google Scholar