Efficient dissemination in decentralized social networks

2011 IEEE International Conference on Peer-to-Peer Computing, P2P 2011 - Proceedings

Volumn , Issue , 2011, Pages 338-347

  Mega, Giuliano ^a   Montresor, Alberto ^a   Picco, Gian Pietro ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRALIZED ARCHITECTURE; GOSSIP PROTOCOLS; ONLINE SOCIAL NETWORKS; PRIVACY VIOLATION; RESEARCH QUESTIONS; SOCIAL NETWORKS; STEPPING STONE;

COMPUTER SIMULATION; DATA PRIVACY; DISTRIBUTED COMPUTER SYSTEMS; OVERLAY NETWORKS; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES COMPUTING;

PEER TO PEER NETWORKS;

EID: 80055001784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2011.6038753     Document Type: Conference Paper

References (28)

1. J. Rothschild, "High Performance at Massive Scale - Lessons learned at Facebook," http://cns.ucsd.edu/lecturearchive09.shtml#Roth.
2. D. Boyd and E. Hargittai, "Facebook privacy settings: Who cares?" First Monday, vol. 15, no. 8, 2010.
3. D. Boyd and N. B. Ellison, "Social network sites: Definition, history, and scholarship," Jrnl. of Computer-Mediated Comm., vol. 13, 2007.
4. F. Benevenuto, T. Rodrigues, M. Cha, and V. Almeida, "Characterizing user behavior in online social networks," in Proc. Internet Measurement Conf. (IMC'09), 2009.
5. S. Buchegger, D. Schiöberg, L. hung Vu, and A. Datta, "PeerSoN: P2P social networking - early experiences and insights," Proc. Workshop on Social Network Systems (SNS'09), 2009.
6. K. Graffi, C. Gross, P. Mukherjee, A. Kovacevic, and R. Steinmetz, "LifeSocial. KOM: a P2P-Based platform for secure online social networks," in Proc. Conf. P2P Computing (P2P'10), 2010.
7. L. A. Cutillo, R. Molva, and T. Strufe, "Safebook: A privacy-preserving online social network leveraging on real-life trust," IEEE Communications, vol. 47, no. 12, pp. 94-101, Dec. 2009.
8. W. Galuba, "Friend-to-Friend computing: Building the social web at the internet edges," EPFL, Tech. Rep. LSIR-REPORT-2009-003, 2009.
9. M. McPherson, L. Smith-Lovin, and J. M. Cook, "Birds of a feather: Homophily in social networks," Annual Review of Sociology, vol. 27, no. 1, pp. 415-444, 2001.
10. K. Graffi, P. Mukherjee, B. Menges, D. Hartung, A. Kovacevic, and R. Steinmetz, "Practical security in p2p-based social networks," in Proc. Conf. Local Computer Networks (LCN'09), 2009.
11. A.-M. Kermarrec, L. Massouli, and A. J. Ganesh, "Probabilistic reliable dissemination in large-scale systems," IEEE Trans. Parallel Distributed Computing, vol. 14, no. 3, pp. 248-258, 2003.
12. P. Saint-Andre, "Extensible Messaging and Presence Protocol (XMPP): Core," RFC 6120, IETF, Mar. 2011. [Online]. Available: http://www.ietf.org/ rfc/rfc6120.txt
13. A. Demers et al., "Epidemic algorithms for replicated database maintenance," in Proc. Intl. Conf. on Principles of Distributed Comp., 1987.
14. A. Montresor and M. Jelasity, "Peersim: A scalable p2p simulator," in Proc. Conf. P2P Computing (P2P'09), 2009.
15. S. H. Lee, P. Kim, and H. Jeong, "Statistical properties of sampled networks," Phys. Rev. E, vol. 73, no. 1, pp. 1-7, Jan. 2006. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevE.73.016102
16. A. Sala et al., "Brief announcement: Revisiting the power-law degree distribution for social graph analysis," in Proc. Conf. on Principles of Distributed Computing (PODC'10), 2010.
17. A. Broder and M. Mitzenmacher, "Network applications of bloom filters: A survey," Internet Mathematics, vol. 1, pp. 636-646, 2002.
18. "Twitaholic website." http://www.twitaholic.com, [visited Apr 2011].
19. Facebook Inc., "Facebook statistics," http://www.facebook.com/ press/info.php?statistics, [visited Apr 2011].
20. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for Large-Scale Peer-to-Peer systems," in Proc. Conf. on Middleware (Middleware'01), 2001.
21. Z. Yao, D. Leonard, X. Wang, and D. Loguinov, "Modeling heterogeneous user churn and local resilience of unstructured P2P networks," in Proc. Intl. Conf. Network Protocols (ICNP'06), 2006.
22. F. Rahimian, S. Girdzijauskas, A. Hossein Payberah, and S. Haridi, "Vi-tis: A gossip-based hybrid overlay for internet-scale publish/subscribe enabling rendezvous routing in unstructured overlay networks," in Proc. Intl. Parallel & Distributed Processing Symp. (IPDPS'11), 2011.
23. S. Girdzijauskas, G. Chockler, Y. Vigfusson, Y. Tock, and R. Melamed, "Magnet: practical subscription clustering for internet-scale publish/subscribe," in Proc. Conf. Distributed Event-Based Sys., 2010.
24. B. Wong and S. Guha, "Quasar: A probabilistic publish-subscribe system for social networks," in Proc. Intl. Workshop on P2P Sys., 2008.
25. A. Datta and R. Sharma, "Godisco: Selective gossip based dissemination of information in social community based overlays," in Proc. Intl. Conf. Distributed Computing and Networking (ICDCN'11), 2011.
26. A. Rapoport, "Spread of information through a population with so-ciostructural bias: I. assumption of transitivity." Bulletin of Mathematical Biophysics 15, pp. 523-533, 1953.
27. M.-J. Lin and K. Marzullo, "Directional gossip: Gossip in a wide area network," in Proc. European Dependable Computing Conf., 1999.
28. A. Boutet, D. Frey, R. Guerraoui, and A.-M. Kermarrec, "WhatsUp: news from, for, through everyone," in Proc. Conf. P2P Computing, 2010.