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.
This work is supported by the ERC Starting Grant GOSSPLE number 204742.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Web 2.0, www.citeulike.org , www.delicious.com , www.flickr.com , www.last.fm
Yildirim, H., Krishnamoorthy, M.S.: A random walk method for alleviating the sparsity problem in collaborative filtering. In: RecSys, pp. 131–138 (2008)
Cattuto, C., Benz, D., Hotho, A., Stumme, G.: Semantic analysis of tag similarity measures in collaborative tagging systems. In: OLP3, pp. 39–43 (2008)
Zanardi, V., Capra, L.: Social ranking: uncovering relevant content using tag-based recommender systems. In: RecSys, pp. 51–58 (2008)
Bender, M., Crecelius, T., Kacimi, M., Miche, S., Xavier Parreira, J., Weikum, G.: Peer-to-peer information search: Semantic, social, or spiritual? TCDE 30(2), 51–60 (2007)
McGill, M., Salton, G.: Introduction to modern information retrieval (1986)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. TOCS 25(3) (2007)
Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: byzantine resilient random membership sampling. In: PODC, pp. 145–154 (2008)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. CACM 13(7), 422–426 (1970)
Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: SP, pp. 44–59 (1997)
Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.D.: Sybilguard: defending against sybil attacks via social networks. TON 16(3), 576–589 (2008)
Handurukande, S.B., Kermarrec, A.M., Le Fessant, F., Massoulie, L., Patarin, S.: Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems. In: EuroSys, pp. 359–371 (2006)
Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Europar, pp. 1143–1152 (2005)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)
Abiteboul, S., Preda, M., Cobena, G.: Adaptive on-line page importance computation. In: WWW, pp. 280–290 (2003)
Fogaras, D., Rácz, B., Csalogány, K., Sarlós, T.: Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics 2(3), 333–358 (2005)
Amer-Yahia, S., Benedikt, M., Lakshmanan, L., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. In: VLDB, pp. 710–721 (2008)
Mislove, A., Gummadi, K.P., Druschel, P.: Exploiting social networks for internet search. In: HotNets (2006)
Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: IMC, pp. 29–42 (2007)
Ahn, Y.Y., Han, S., Kwak, H., Moon, S., Jeong, H.: Analysis of topological characteristics of huge online social networking services. In: WWW, pp. 835–844 (2007)
Khambatti, M., Ryu, K.D., Dasgupta, P.: Structuring peer-to-peer networks using interest-based communities. In: DBISP2P, pp. 48–63 (2003)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. INFOCOM 3, 2166–2176 (2003)
Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. In: SPAA, pp. 271–272 (2004)
Chen, G., Low, C.P., Yang, Z.: Enhancing search performance in unstructured p2p networks based on users’ common interest. TPDS 19(6), 821–836 (2008)
Sedmidubsky, J., Barton, S., Dohnal, V., Zezula, P.: Adaptive approximate similarity searching through metric social networks. In: ICDE, pp. 1424–1426 (2008)
Eyal, A., Gal, A.: Self organizing semantic topologies in p2p data integration systems. In: ICDE, pp. 1159–1162 (2009)
Jin, H., Ning, X., Chen, H.: Efficient search for peer-to-peer information retrieval using semantic small world. In: WWW, pp. 1003–1004 (2006)
Le-Blond, S., Guillaume, J.L., Latapy, M.: Clustering in p2p exchanges and consequences on performances. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 193–204. Springer, Heidelberg (2005)
Patel, J.A., Rivière, Ł., Gupta, I., Kermarrec, A.M.: Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems. Computer Networks 53(13), 2304–2320 (2009)
Crespo, A., Garcia-Molina, H.: Semantic overlay networks for p2p systems. In: Moro, G., Bergamaschi, S., Aberer, K. (eds.) AP2PC 2004. LNCS (LNAI), vol. 3601, pp. 1–13. Springer, Heidelberg (2005)
Banaei-Kashani, F., Shahabi, C.: Swam: a family of access methods for similarity-search in peer-to-peer data networks. In: CIKM, pp. 304–313 (2004)
Li, M., Lee, W.C., Sivasubramaniam, A., Zhao, J.: Ssw: A small-world-based overlay for peer-to-peer search. TPDS 19(6), 735–749 (2008)
Carman, M., Baillie, M., Crestani, F.: Tag data and personalized information retrieval. In: SSM, pp. 27–34 (2008)
Jie, H., Zhang, Y.: Personalized faceted query expansion. In: SIGIR (2006)
Bender, M., Crecelius, T., Kacimi, M., Michel, S., Neumann, T., Parreira, J.X., Schenkel, R., Weikum, G.: Exploiting social relations for query expansion and result ranking. In: ICDE Workshops, pp. 501–506 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bertier, M., Frey, D., Guerraoui, R., Kermarrec, AM., Leroy, V. (2010). The Gossple Anonymous Social Network. In: Gupta, I., Mascolo, C. (eds) Middleware 2010. Middleware 2010. Lecture Notes in Computer Science, vol 6452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16955-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-16955-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16954-0
Online ISBN: 978-3-642-16955-7
eBook Packages: Computer ScienceComputer Science (R0)