[p2p-hackers] Interest based locality and query distribution

Greg Bildson gbildson at limepeer.com
Tue Mar 22 16:03:41 UTC 2005


Anecdotally, I would say that only your point number 5 is correct.  Point 1
is somewhat correct but given that we have done old studies showing that
caching of results is not useful, the focus of queries is much more spread
out than you believe.  (No I don't have the caching studies available.)

I don't believe 2 or 3 at all.

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: Tuesday, March 22, 2005 10:14 AM
> To: p2p-hackers at zgp.org
> Subject: [p2p-hackers] Interest based locality and query distribution
>
>
> Hi all
> recently several unstructured peer-to-peer systems dynamically select
> neighbours for each peer using the principle of interest-based locality,
> e.g. [1,2,3,4].  To model and simulate the behaviour in such networks
> information about the distribution of interests of each user, e.g. the
> queries each user issues and the content each user publishes, is
> required.  I'm interested to prove the following hypotheses:
>
> 1.) Queries follow a Zipf distribution, only a few queries are highly
> popular, while the majority of the queries cover only rare topics.
> 2.) A minority of users issues the majority of all queries.
> 3.) It is very likely, that these users also stay for a long time in the
> network.
> 4.) Most of the queries cover only own interests. What percentage of
> queries is issued to 'random' topics?
> 5.) User interests follow a Zipf distribution, e.g. a user spends much
> of her queries to only one or two topics.
>
> Does anybody know citations from real file sharing trace, e.g. Gnutella,
> Kazaa that support or reject my hypotheses?
>
> Alex
>
>
> [1] V. Cholvi, P. Felber, and E.W. Biersack. Efficient Search in
> Unstructured Peer-to-Peer Networks.
> [2] Adriana Iamnitchi, Matei Ripeanu and Ian Foster, Small World File
> Sharing Communities.
> [3] J. Keller, D. Stern and F. Dang Ngoc. MAAY: A Self-Adaptive Peer
> Network for Efficient Document Search.
> [4] 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 Universität Berlin
>   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