ELECTION IN ASYNCHRONOUS COMPLETE NETWORKS WITH INTERMITTENT LINK FAILURES

We consider the problem of fault-tolerant leader election in asynchronous complete (fully-connected) distributed networks. The processors are reliable, but some of the communication channels may fail intermittently before or during the execution of the algorithm. Channel failures are undetectable due to the asynchronous nature of the network. Let n be the number of processors in the network and f be the maximum number of faulty channels incident on each processor, where f less-than-or-equal-to [n-1/2]. Our algorithm uses at most O(n2 + nf2) messages to elect a unique leader of the network. Each message consists of at most O(log \T\) bits, where \T\ is the cardinality of the set of processor identifiers. AH previous algorithms either tolerated only benign failures such as fail-stop failures, assumed that the network is synchronous, tolerated only a small number of failures, or assumed that the faults are detectable. Our algorithm is the first election algorithm that is designed specifically for asynchronous intermittently faulty complete networks in which up to n/2 [n-1/2] channels may be faulty, where each processor is adjacent to no more than [n-1/2] faulty channels, and where the faults are undetectable.