[chord] Fwd: Question about Chord algorithm

[Arman Didandeh]

Dear Chord list members,

I was just thinking about the case when each processor's finger table keeps
only two entries.
Of course one needs to be the successor of each processor. But what about
the other one?

Since we need to minimize the number of messages passed in the network, as
well as to ensure any key to be findable, which other processor do you
suggest to keep?

   - the predecessor's ID?
   - its own ID n?
   - the farthest processor's ID, which is successor(n+2^(m/2))?
   - etc

Thanks in advance for the reply.

Best,
Arman
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://amsterdam.lcs.mit.edu/pipermail/chord/attachments/20130319/f66c16a4/attachment-0001.htm