Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
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.
https://hal.inria.fr/inria-00515693 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Tuesday, August 12, 2014 - 10:46:30 AM Last modification on : Wednesday, February 2, 2022 - 3:50:47 PM Long-term archiving on: : Wednesday, November 26, 2014 - 10:46:27 PM
Marin Bertier, Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Vincent Leroy. The Gossple Anonymous Social Network. ACM/IFIP/USENIX 11th International Middleware Conference (MIDDLEWARE), Nov 2010, Bangalore, India. pp.191-211, ⟨10.1007/978-3-642-16955-7_10⟩. ⟨inria-00515693v2⟩