Re: Re: Creating a Query for a SHA-1 Hash

Arne Babenhauserheide <[email protected]> Mon, 5 Jan 2009 17:14:18 +0100
Newsgroups gmane.network.gnutella.devel
Message-ID <[email protected]>
Am Montag 05 Januar 2009 16:05:33 schrieb Aaron Walkhouse:
> If you're just dropping them and not helping with results from the
> DHT, how exactly ARE you supporting them?  What are you doing with
> hash queries that come through a peer?  What about leaves from other
> vendors?  
>
> How does a single query cost more bandwidth to the leaf or peer that
> sent it, since it is just one query?  Is an issuer something other
> than the one node that made the query in the first place?

The DHT works completely different from the structured broadcast GNutella uses 
for keywords. 

Keywor queries get sent out and the rest of the network passes them on. You 
can see it like the network doing the work for you. 

In a DHT search you personally contact each possible node on the path, and the 
algorithm allows you to find an optimized path to the content you search for. 

It's been proven, that the DHT massively skales for hash queries, though, 

Would an Ultrapeer "proxy" hash queries, it would have to do the full search 
itself - possibly for every single leaf. I think you can imagine how much that 
could overload the UP when it has more than one leaf to proxy. 

Best wishes, 
Arne
-- 
-- My stuff: http://draketo.de - stories, songs, poems, programs and stuff :)
-- Infinite Hands: http://infinite-hands.draketo.de - singing a part of the 
history of free software.
-- Ein Würfel System: http://1w6.org - einfach saubere (Rollenspiel-) Regeln.

-- PGP/GnuPG: http://draketo.de/inhalt/ich/pubkey.txt


[Non-text portions of this message have been removed]