[p2p-hackers] Work on NAT-friendly DHTs?

[Philip Matthews]

Dani:

Thanks for your reply.

I have given some thought to this topic, but I don't have a solution  
yet.
Right now, I am just looking to see what others might have done.

- Philip


On 26-Jan-06, at 10:49 , Dani Eichhorn wrote:

> Hi Philip
>
> I'm working on this topic for my diploma thesis. My first priority  
> goal is to implement a NAT traversal library that works  
> independently from any p2p routing algorithm. But I'm aware that a  
> perfectly designed algorithm would be much more efficient than this  
> workaround.
> I don't know, if you know about this library: http:// 
> nutss.gforge.cis.cornell.edu/stunt.php
> which is an architecture that provides endpoint-to-endpoint TCP  
> connections, yet using one or several central server(s). I'm trying  
> to adapt it for distributed applications, like DHT based frameworks.
>
> If you already have a solution in mind, I'd be glad to discuss it  
> with you..
>
> Dani
>
> Am 26.01.2006 um 16:09 schrieb Philip Matthews:
>
>> I am wondering if anyone is aware of work on NAT-friendly DHT  
>> algorithms?
>> In other words, a DHT algorithm that works with the peers are  
>> located behind NATs.
>>
>> From what I have seen. most DHT algorithms assume that any peer is  
>> directly reachable
>> from any other peer, which is not true when peers are located  
>> behind NATs.
>> Both Chord and Kademlia, for example, seem to make this assumption.
>>
>> - Philip
>> _______________________________________________
>> p2p-hackers mailing list
>> p2p-hackers at zgp.org
>> http://zgp.org/mailman/listinfo/p2p-hackers
>> _______________________________________________
>> Here is a web page listing P2P Conferences:
>> http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences
>>
>