[p2p-hackers] A Question about user awareness in p2p

[Greg Bildson]

I agree here.  I expect you would want two things.  You would want a DHT for
lookup of your buddies and publishing of yourself being online. You may also
want to publish your interest in these particular users coming online so
that clients don't need to continually poll the DHT for their buddies.  This
would allow you to learn that your buddies came online more quickly though a
callback at a lower lookup cost (but higher storage cost in the DHT).

Thanks
-greg

> -----Original Message-----
> From: p2p-hackers-bounces at zgp.org [mailto:p2p-hackers-bounces at zgp.org]On
> Behalf Of Michael J. Freedman
> Sent: Tuesday, March 22, 2005 10:00 AM
> To: Anoop Mavilaveettil; Peer-to-peer development.
> Subject: Re: [p2p-hackers] A Question about user awareness in p2p
>
>
> On Tue, 22 Mar 2005, Anoop Mavilaveettil wrote:
>
> > Date: Tue, 22 Mar 2005 02:27:10 -0800
> > From: Anoop Mavilaveettil <anoopsmv at gmail.com>
> > To: p2p-hackers at zgp.org
> > Subject: [p2p-hackers] A Question about user awareness in p2p
> >
> > Hello,
> > First of all, let me thank you for all the sharing of knowledge that
> > is going on in here.I must say that, I have learned a lot, ever since
> > I started frequenting this list.
>
> ...
>
> > b)Using an overlay of super peers/ meta trackers for user tracking and
> > then them firing all required messages to interested peers, whenever a
> > user connects to the p2p net.
> > As I said earlier, both methods aren't that great in terms of
> > efficiency and/or robustness. Is there some other way or any other
> > techniques that could be used to let a peer instantly know about the
> > connection status of his buddy?
>
> Hi Sreedhar,
>
> This type of "discovering needles in the haystack" problem is exactly
> where structured routing overlays (or, perhaps slightly inaccurately,
> distributed hash tables) perform superiorly to unstructured routing
> meshes (like Gnutella et al.).
>
> Using such a distributed indexing layer, when a peer joins the system, it
> announces itself under its system handle; when another peer joins, it
> searches for its buddies under their handles in this shared architecture.
>
> To ensure freshness, these announcements should have a TTL; still, they
> need not be all that short, as information learned from the "DHT" can of
> course be verified by peers (i.e., ping them to check if still alive).
>
> For more information on structured overlays, I suggest looking at the
>
>    MIT Chord -- http://pdos.lcs.mit.edu/chord/
>    Rice/MSR Pastry -- http://freepastry.rice.edu/
>
> For an example of using these type of interfaces for node discovery under
> such weak consistency requirements, check out our use in:
>
>    CoralCDN -- http://www.coralcdn.org/
>
> If you just want an "working" DHT to play with, you can use the deployed
> OpenDHT service as such a rendezvous point.
>
>    OpenDHT -- http://www.opendht.org/
>
>
> Good luck,
> --mike
>
>
> -----
> "Not all those who wander are lost"             www.michaelfreedman.org
> "You make it fun; we'll make it run"                   www.coralcdn.org
> _______________________________________________
> 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