This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Leader Election in the Presence of Link Failures
March 1996 (vol. 7 no. 3)
pp. 231-236

Abstract—We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2 − 1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N2).

[1] H. Abu-Amara, "Fault-tolerant Distributed Algorithms for Election in Complete Networks," IEEE Trans. Computers, vol. 37, no. 4, pp. 449-553, 1988.
[2] Y. Afek and E. Gafni, "Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks," SIAM J. Computing, vol. 20, no. 2, pp. 376-394, 1991.
[3] R. Bar-Yehuda and S. Kutten, and Y. Wolfstahl, and S. Zaks, "Making Distributed Spanning Tree Algorithms Fault-resilient," STACS, 1987.
[4] O. Goldreich and L. Shrira, "The Effect of Link Failures on Computations in Asynchronous Rings," Proc. ACM Symp. Principles of Distributed Computing, 1986.
[5] E. Korach,S. Moran,, and S. Zaks,“Tight lower and upper bounds for some distributed algorithms for completenetwork of processors,” Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 199-207, 1984.
[6] T. Masuzawa and N. Nishikawa, and K. Hagihara, and N. Tokura, "Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction," Proc. Third Int'l Workshop on Distributed Algorithms, 1989.
[7] G. Singh, "Leader Election in Complete Networks," ACM Symp. Principles of Distributed Computing, pp. 179-190, 1992.

Index Terms:
Election, complete networks, intermittent link failures, distributed algorithms, message complexity.
Citation:
Gurdip Singh, "Leader Election in the Presence of Link Failures," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 231-236, March 1996, doi:10.1109/71.491576
Usage of this product signifies your acceptance of the Terms of Use.