Chord (distributed hash table) - Wikipedia, the free encyclopedia - The Diigo Meta page

• 04 Aug 08
  

  jun zhang
  • If Chord keeps track of r = O(log N) predecessors/successors, then with high probability, if each node has probability of 1/4 of failing, find_successor (see below) and find_predecessor (see below) will return the correct nodes
• 28 Jul 08
  

  Jun Ye

  Chord

Would you like to comment?

Join Diigo for a free account, or sign in if you are already a member.