Mailing-List: contact user-help@zookeeper.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@zookeeper.apache.org
Received-SPF: pass (athena.apache.org: local policy)
From: <Ben.Young@sungard.com>
To: <user@zookeeper.apache.org>
Subject: Leader election in C# client
Thread-Topic: Leader election in C# client
Thread-Index: Ac7qjW9SFjQNNdbPRB2aNX7DQrnOKg==
Date: Tue, 26 Nov 2013 09:57:59 +0000
Message-ID: 
 <7B36F63619C46A49B86E0D5AB8CDD200617029B9@emea-tc2-mb02.internal.sungard.corp>
Accept-Language: en-GB, en-US
Content-Language: en-US
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
MIME-Version: 1.0

Hi,

I was looking at the leader election algorithm in the .NET client at https:=
//github.com/ewhauser/zookeeper/blob/trunk/src/dotnet/ZooKeeperNet.Recipes/=
LeaderElection.cs

There is a point I don't understand and I was wondering if someone could cl=
arify for me. The recipe creates ephemeral nodes of the form "election-<ses=
sionid>-<sequentialid>", I think to be able to see if it has already create=
d the node (perhaps due to a retry?). However, doesn't having the session i=
d in the node name then throw out the sorting of the nodes in the next step=
, to find the previous node to watch? I'd have thought it would then be sor=
ting by session id and not sequential id? Perhaps that doesn't matter as lo=
ng as only one node gets picked?

Thanks,
Ben

Ben Young=A0.=A0Senior Software Engineer=A0. Adaptiv . Position, Risk & Ope=
rations . SunGard . Enterprise House, Histon, Cambridge, CB24 9ZR . =A0Tel =
+44 (0) 1223 266042 . ben.young@sungard.com . www.sungard.com

=A0