IEEE Transactions on Parallel and Distributed Systems · 1996 · 89 citations · 6 references
ComputingComputer EngineeringComputer ScienceDistributed SystemsFault-tolerant ComputingFault-tolerant SystemsCommunication ComplexityFault-tolerant CommunicationLeader ElectionNetwork Fault ToleranceNetwork ReliabilityReliable Distributed SystemsComplexityDistributed Leader ElectionFault-tolerant Gossip ProtocolsFault-tolerant Leader ElectionLeader Election Under FailureMessage ComplexityMessage Complexity In Distributed ComputationNetwork Reliability Algorithms
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(N/sup 2/).
6
Leader election in complete networks
Gurdip Singh · 1992 · 31 citations · Full text
Leader Election in Complete Networks
Gurdip Singh · SIAM Journal on Computing · 1997 · 20 citations