[p2p-hackers] Paradigma Question: DHT's or Small World?
Greg Bildson
gbildson at limepeer.com
Thu Feb 3 15:26:25 UTC 2005
I'd just like to point out that Gnutella does not use pure flooding anymore
and you are unlikely to find P2P networks that don't have something akin to
supernodes. Gnutella uses bloom filter based keyword index replication and
dynamic querying (selectively sending out queries until a result limit is
reached) to reduce the overhead of flooding for popular queries and to route
all queries on the last hop.
Thanks
-greg
> -----Original Message-----
> From: p2p-hackers-bounces at zgp.org [mailto:p2p-hackers-bounces at zgp.org]On
> Behalf Of Alexander Löser
> Sent: Thursday, February 03, 2005 5:32 AM
> To: p2p-hackers at zgp.org
> Subject: [p2p-hackers] Paradigma Question: DHT's or Small World?
>
>
> Hey all,
> structured overlay networks based on DHT's, such as Pastry and Chord
> among others, have been investigated in the past to construct scalable
> and performance orientated peer-to-peer networks. However, unstructured
> networks, such as Gnutella or Kazaa, are still widely used among the
> file sharing community. Recently researchers proposed extensions to
> unstructured networks networks based on the small world idea: peers
> dynamically create shortcuts to other peers based on their interests.
> Over a while peers with the same interests became direct neighbors
> through its shortcuts and build interest based clusters. Hence peers
> no longer flood messages but partly route it's queries via a interested
> based/semantic overlay. Examples are described in [1] [2] among
> others.
>
> Comparing small world and DHT approaches is a difficult task, since
> simulations usually differ in scenarios, data sets or simulation
> methodology. I'm interested in scenarios and arguments PRO small
> world overlays for unstructured networks. Does anybody now actual
> theoretic or practical work that compares both approaches in different
> scenarios (high churn, no super peers, key word based search, meta data
> based search)? Which scenarios or arguments support small world
> approaches for unstructured networks?
>
> Alex
>
>
>
>
> [1] Gia - Making Gnutella like P2P Systems Scalable
> http://berkeley.intel-research.net/sylvia/1103-chawathe.pdf
> http://seattle.intel-research.net/people/yatin/publications/talks/
> sigcomm2003-gia.ppt
>
> [2] Efficient Content Location Using Interest Based Locality in
> Peer-to-Peer Systems
> http://www.ieee-infocom.org/2003/papers/53_01.PDF
> --
> ___________________________________________________________
>
> Alexander Löser
> Technische Universitaet Berlin
> hp: http://cis.cs.tu-berlin.de/~aloeser/
> office: +49- 30-314-25551
> fax : +49- 30-314-21601
> ___________________________________________________________
>
>
> _______________________________________________
> 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
More information about the P2p-hackers
mailing list