Abstract : While social networks provide news from old buddies,
you can learn a lot more from people you do not know, but with whom you
share many interests. We show in this paper how to build a network of
anonymous social acquaintances using a gossip protocol we call Gossple,
and how to leverage such a network to enhance navigation within Web 2.0
collaborative applications, à la LastFM and Delicious. Gossple nodes
(users) periodically gossip digests of their interest profiles and
compute their distances (in terms of interest) with respect to other
nodes. This is achieved with little bandwidth and storage, fast
convergence, and without revealing which profile is associated with
which user. We evaluate Gossple on real traces from various Web 2.0
applications with hundreds of PlanetLab hosts and thousands of simulated
nodes.
Type de document :
Communication dans un congrès
Indranil Gupta; Cecilia Mascolo. ACM/IFIP/USENIX 11th International Middleware Conference (MIDDLEWARE), Nov 2010, Bangalore, India. Springer, Lecture Notes in Computer Science, LNCS-6452, pp.191-211, 2010, Middleware 2010. 〈10.1007/978-3-642-16955-7_10〉
https://hal.inria.fr/inria-00515693
Contributeur : Hal Ifip
<>
Soumis le : mardi 12 août 2014 - 10:46:30
Dernière modification le : mercredi 16 mai 2018 - 11:23:13
Document(s) archivé(s) le : mercredi 26 novembre 2014 - 22:46:27
