Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks

摘要

The well-known problem of leader election in distributed systems is considered ina dynamic context where processes may participate and crash spontaneously. In this paper, we design a leader election protocol in such a dynamic context. In the initial design, processes are considered to be perfect and a leader is assumed to be present initially. In the second protocol, the assumption of an initial leader is dropped. Finally, in the last step design processes may crash without giving any notification of other processes. The worst case message complexity of all protocols is addressed.