I have already read that paper. It only says that the peer with biggest zxid wins and that there are two implementations for the Leader election. But it offers no details about the UDP algorithm neither about the Fast Election algorithm.
Regards, André On Mon, May 2, 2011 at 23:18, chuang <[email protected]> wrote: > read the pdf published by Yahoo: > http://research.yahoo.com/files/ladis08.pdf > > On Tue, May 3, 2011 at 9:59 AM, André Oriani < > [email protected]> wrote: > >> Hi , >> >> Where can I find a good description of the fast leader election used >> by ZooKeeper. I would like to understand better how logical clock is >> used and the two termination conditions ( a quorum has voted for a >> certain peer or have received votes from all peers) , if I have >> identified correctly. >> >> The first thing QuorumCxnManager when connecting to a peer is to send >> its id. Is this done to avoid any problem with concurrent connections? >> >> Thanks and Regards, >> André Oriani >> >
