The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Time and message bounds for election in synchronous and asynchronous complete networks
SIAM Journal on Computing
Leader election in complete networks
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Proceedings of the 3rd International Workshop on Distributed Algorithms
Making Distributed Spanning Tree Algorithms Fault-Resilient
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
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 Highly Available Local Leader Election Service
IEEE Transactions on Software Engineering
On the Dynamic Initialization of Parallel Computers
The Journal of Supercomputing
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Reaching Fault Diagnosis Agreement under a Hybrid Fault Model
IEEE Transactions on Computers
On the Dynamic Initialization of Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
A new leader election implementation
Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
An autonomic election algorithm based on emergence in natural systems
Integrated Computer-Aided Engineering - Autonomous Computing
The election problem in asynchronous distributed systems with bounded faulty processes
The Journal of Supercomputing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
McErlang: a model checker for a distributed functional programming language
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Modified bully election algorithm in distributed systems
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Leader Election in Extremely Unreliable Rings and Complete Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
DR: Divided Ring Leader Election Algorithm
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
An efficient election protocol in a mobile computing environment
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Constructing underwater sensor based barriers using distributed auctions
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A leader election protocol for timed asynchronous distributed systems
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Revisiting the election problem in asynchronous distributed systems
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Solving election problem in asynchronous distributed systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
The election problem in asynchronous distributed systems with bounded faulty processes
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Semi-formal development of a fault-tolerant leader election protocol in erlang
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Coordinator election using the object model in p2p networks
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
| Hi-index | 0.00 |
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(N2).