Optimal resilient distributed algorithms for ring election |
| |
| Authors: | Chan MY Chin FYL |
| |
| Affiliation: | Dept. of Comput. Sci., Hong Kong Univ.; |
| |
| Abstract: | 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 &thetas;(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 |
| |
| Keywords: | |
|
|
