Which DHT algorithm to use (if I want to join two separate DHTs)?

Posted by webdreamer on Stack Overflow See other posts from Stack Overflow or by webdreamer
Published on 2010-03-24T10:10:51Z Indexed on 2010/03/24 10:13 UTC
Read the original article Hit count: 353

I've been looking into some DHT systems, specially Pastry and Chord. I've read some concerns about Chord's reaction to churn, though I believe that won't be a problem for the task I have at hands. I'm implementing some sort of social network service that doesn't rely on any central servers for a course project. I need the DHT for the lookups.

Now I don't know of all the servers in the network in the beginning. As I've stated, there's no main tracker server. It works this way: each client has three dedicated servers. The three servers have the profile of the client, and it's wall, it's personal info, replicated. I only get to know about other group of servers when the user adds a friend (inputing the client's address). So I would create two separate DHTs on the two groups of three servers and when they friend each other I would like to join the DHTs. I would like to this consistently. I haven't had a lot of time to get all that familiar with the protocols, so I would like to know which one is better if I want to join the two separate DHTs?

© Stack Overflow or respective owner

Related posts about dht

Related posts about chord