By Topic

Optimal resilient distributed algorithms for ring election

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chan, M.Y. ; Dept. of Comput. Sci., Hong Kong Univ., Hong Kong ; Chin, F.Y.L.

The problem of electing a leader in a dynamic ring in which processors are permitted to fail and recover during election is discussed. It is shown that θ(n log n+kr) messages, counting only messages sent by functional processors, are necessary and sufficient for dynamic ring election, where kr is the number of processor recoveries experienced

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:4 ,  Issue: 4 )