Distributed Hash Tables, Part I - The Diigo Meta page

• 03 Feb 14
  

  Roaan Vos

  DHT python

• 17 Jan 13
  

  DHT distributed programming

• 22 Nov 12
  

  rohit saxena

  dht

• 29 Dec 11
  

  Bruno Melo

  hash DHT distributed hashing chord programming

• 

  cvalentim

  hash

• 

  Jorge Ikeda

  @hackernewsbot: Distributed Hash Tables, Part I... http://t.co/SY0bmr8X

  ifttt twitter

• 15 Aug 11
  

  chico qb
• 28 May 11
  

  liang wu

  c#-dsa

• 

  Dongsu Park

  dht linux hash

• 21 Nov 10
  

  Lodovico Ketjapo

  http://web.archive.org/web/20080527093630/http://www.linuxjournal.com/print/6797

  hashing

• 13 Sep 10
  

  Arpad Banhidi

  distributed hash tables DHT linux

• 23 Nov 09
  

  Charles Nadeau

  python tutorial algorithms

• 26 Jun 09
  

  dht distributed hash table algorithm

• 20 Feb 09
  

  Hamada Kazunori

  network programming python p2p distributed algorithm algorithms dht hash

• 15 Jan 09
  

  Capt. Ben Smith

  hash

• 28 Oct 08
  

  timwee

  distributed hashing consistent-hashing cluster chord p2p python scaling caching interview

• 06 Aug 08
  

  jun zhang
  • First, take the key and hash it to generate a key of exactly k bits. Treat this number as a node ID, and determine which node is its successor by starting at any point in the ring and working clockwise until a node is found whose ID is closest to but still greater than the key. The node you find is the node responsible for storage and lookup for that particular key (Listing 2).
  • The new node is responsible for some portion of the keys for which the predecessor node was responsible. In order to ensure that all lookups work without fail, the appropriate portion of keys should be copied to the new node before the predecessor node changes its next node pointer to point to the new node.
  • Therefore, n/2 traversed nodes can be quite slow.
  • each node stores a “finger table” containing the addresses of k nodes.
  • In order to achieve better performance, the Chord design adds a layer to access O(log n) performance.
  • the finger table needs to be kept up to date.

  4 more annotations...

• 27 Jul 08
  

  Jun Ye
  • Distributed hash tables are an essential component of robust peer-to-peer networks. Learn to write applications that let everyone's copy share the same data.
• 18 Apr 08
  

  Yasutaka Nishimura

  algorithms programming scalability distributed computing

• 06 May 07
  

  Alex Kapranoff

  programming dht hash distributed bittorrent chord kademlia

• 23 Feb 07
  

  Distributed hash tables are an essential component of robust peer-to-peer networks. Learn to write applications that let everyone's copy share the same data.

  distributed hash table dht network p2p article neteffects itpresearch delicious

• 13 Jan 07
  

  Kiran Kuppa

  DHTs are an essential component of p2p networks. Learn to write applications that let everyone's copy share the same data.A number of research DHTs have been developed by universities, picked up by the Open Source community and implemented. A few propriet

  algorithms dht p2p distributed

• 15 Oct 06
  

  Ferrari Lee

  DHT mobile

• 19 Oct 05
  

  danchan

Would you like to comment?

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