Optimal Distributed t-Resilient Election in Complete Networks
IEEE Transactions on Software Engineering
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
A Survey on Leader Election Protocols for Radio Networks
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
IEEE/ACM Transactions on Networking (TON)
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
Elections in a Distributed Computing System
IEEE Transactions on Computers
Winsim: a tool for performance evaluation of parallel and distributed systems
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
| Hi-index | 0.00 |
A leader election protocol for timed asynchronous distributed systems is presented. The proposed scheme is based on reliable multicast where all participating processes of the group will receive protocol messages. In this protocol, the group members do not need to know each other's addresses to communicate. Also, they do not have to make any reconfiguration if some members crash, join or leave the group. The paper describes the proposed protocol, estimates its performance in simulation and compares this simulation with an analytical model. It is found that the communication complexity of the protocol is of O(N). As simulation formalism, a class of extended Petri nets was used.