Election in a complete network with a sense of direction
Information Processing Letters
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A resilient distributed protocol for network synchronization
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Making distributed spanning tree algorithms fault-resilient
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A locking protocol for resource coordination in distributed databases
ACM Transactions on Database Systems (TODS)
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Fault-tolerant distributed algorithms for agreement and election
Fault-tolerant distributed algorithms for agreement and election
Optimal Distributed t-Resilient Election in Complete Networks
IEEE Transactions on Software Engineering
Leader election in the presence of link failures (abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Leader election protocols for radio networks
Handbook of wireless networks and mobile computing
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
| Hi-index | 0.01 |
Electron in asynchronous complete networks is considered for the case in which the links may fail intermittently and undetectably. Undetectable link failure is consistent with the standard model of distributed algorithms in which link delays can be arbitrary but finite. An algorithm is given that correctly solves the problem when the links fail before or during the execution of the algorithm. If n is the number of nodes in the network, f the maximum number of fault links, and r a design parameter, the algorithm uses no more than O(nrf+(nr/(r-1) log(n/(r-1)f))) messages, runs in time O(n/(r-1)) f, and uses at most O(log mod T mod ) bits per message, where mod T mod is the cardinality of the set of node identifiers.