On spreading recommendations via social gossip

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 91-97

  Fernandess, Yaacov ^a   Malkhi, Dahlia ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAMMING THEORY;

DISTRIBUTED ALGORITHMS; FUNDAMENTAL THEORIES; GOSSIP MECHANISMS; SOCIAL NETWORKS; SOCIAL SETTINGS;

PARALLEL ALGORITHMS;

EID: 57549085948     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378547     Document Type: Conference Paper

References (37)

1. Nocturnal. http://research. microsoft.com/research/sv/Nocturnal/.
2. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the Spread of Influence Through a Social Network. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137-146, New York, NY, USA, 2003. ACM Press.
3. Y. M. Minsky and F. B. Schneider. Tolerating Malicious Gossip. Distributed Computing, 16(l):49-68, 2003.
4. D. Malkhi, E. Pavlov, and Y. Sella. Optimal Unconditional Information Diffusion. In Proceedings of the 15th International Symposium on DIStributed Computing, 2001.
5. D. Malkhi, M. K. Reiter, O. Rodeh, and Y. Sella. Efficient Update Diffusion in Byzantine Environments. In Proceedings of the 20th IEEE Symposium, cm Reliable Distributed Systems, Washington, DC, USA, 2001. IEEE Computer Society.
6. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenkcr, H. Sturgis, D. Swinehart, and D. Terry. Epidemic Algorithms for Replicated Database Maintenance. In PODC '87: Proceedings of the sixth annual A CM Symposium on Principles of distributed computing, pages 1-12, New York, NY, USA, 1987. ACM Press.
7. D. J. Watts and S. H. Strogatz. Collective dynamics of Şsmall-worldŤ networks. Nature, pages 440U″-442, 1998.
8. J. Kleinberg. The Small-world Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd A CM Symposium, on Theory of Computing, 2000.
9. A. D. Flaxman. Expansion and Lack Thereof in Randomly Perturbed Graphs. Technical report, 2006. Manuscript under submission.
10. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip Algorithms: Design, Analysis and Applications. In Proceedings of IEEE INFOCOM, 2005.
11. D. Mosk-Aoyama and D. Shah. Computing Separable Functions via Gossip. In PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pages 113-122, New York, NY, USA, 2006. ACM Press.
12. K. Lidl, J. Osborne, and J. Malcome. Drinking from the Firehose: Multicast Usenet News. In Proceedings of the Usenix Winter Conference, pages 33-45, January 1994.
13. A. D. Birrell, R. Levin, R. M. Needham, and M. D. Schroeder. Grapevine, an Exercise in Distributed Computing. Communications of the ACM, 25(4):260-274, 1982.
14. Z. Haas, J. Y. Halpern, and L. Li, Gossip-based ad hoc Routing. In Proceedings of IEEE INFOCOM, June 2002.
15. R. van Renesse, Y. Minsky, and M. Hayden. A Gossip-style Failure Detection Service. In Proceedings of Middleware, 1998.
16. R.van Renesse. Scalable and Secure Resource Location. In Proceedings of IEEE Hawaii International Conference on System Sciences, January 2000.
17. P. Th. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A. -M. Kermarrec. Lightweight Probabilistic Broadcast. ACM Trans. Comput. Syst., 21(4):341-374, 2003.
18. A. J. Ganesh, A. Kermarrec, and L. Massoulié. Peer-to-peer Membership Management for Gossip-based Protocols. IEEE Transactions on Computers, 52(2), February 2003.
19. S. Voulgaris, D. Gavidia, and M. van Steen. Cyclon: Inexpensive Membership Management for Unstructured p2p overlays. J. Network Syst. Manage., 13(2), 2005.
20. R. Guerraoui, S. B. Handurukande, and A. -M. Kermarrec. GosSkip: a Gossip-based Structured Overlay Network for Efficient Content-based Filtering. Technical report, 2004.
21. Y. Fernandess and D. Malkhi. On Collaborative Content Distribution using Multi-message Gossip. In IPDPS: IEEE International Parallel and, Distributed Processing Symposium. IEEE, April 2006.
22. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized Rumor Spreading. In FOCS '00: Proceedings of the 41st Annual Symposium, on Foundations of Computer Science, page 565, Washington, DC, USA, 2000.
23. D. Malkhi, Y. Mansour, and M. K. Reiter. On Diffusing Updates in a Byzantine Environment. In Proceedings of the 18th, IEEE Symposium, on Reliable Distributed Systems, page 134, Washington, DC, USA, 1999. IEEE Computer Society.
24. M. Feldman and J. Chuang. Overcoming Free-riding Behavior in Peer-to-peer Systems. SIGecom Exch., 5(4):41-50, 2005.
25. A. Cheng and E. Friedman. Sybilproof Reputation Mechanisms. In P2PECON '05: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 128-132, New York, NY, USA, 2005. ACM Press.
26. M. Feldman, K. Lai, I. Stoica, and J. Chuang. Robust Incentive Techniques for Peer-to-peer Networks. In P2PECON '04: Proceeding of the 2004 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 102-111, New York, NY, USA, 2004. ACM Press.
27. Z. Abrams and R. Mcgrew. Keeping Peers Honest in Eigentrust. In P2PECON '04: Proceeding of the 2004 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 102-111, New York, NY, USA, 2004. ACM Press.
28. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The Eigentrust Algorithm for Reputation Management in p2p Networks. In WWW '03: Proceedings of the 12th international conference on World Wide Web, pages 640-651, New York, NY, USA, 2003. ACM Press.
29. L. Mui, M. Mohtashemi, and A. Halberstadt. A Computational Model of Trust and Reputation for e-businesses. In HICSS '02: Proceedings of the 35th Annual, Hawaii International Conference on System Sciences (HICSS'02)-Volume 7, page 188, Washington, DC, USA, 2002. IEEE Computer Society.
30. P. Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman. Reputation Systems. Commun. ACM, 43(12):45-48, 2000.
31. J. R. Douceur. The Sybil Attack. In IPTPS '01: Revised Papers from, the First International Workshop on Peer-to-Peer Systems, pages 251-260, London, UK, 2002. Springer-Verlag.
32. R. A. Bazzi and G. Konjevod. On the Establishment of Distinct Identities in Overlay Networks. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 312-320, New York, NY, USA, 2005. ACM Press.
33. M. F. Kaashoek G. Danezis, C. Lesniewski-Laas and R. Anderson. Sybil-resistant DHT Routing. In In European Symposium On Research In Computer Security, pages 305-318, September 2005.
34. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybilguard: Defending Against Sybil Attacks via Social Networks. In SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, pages 267-278, New York, NY, USA, 2006. ACM Press.
35. P. Maniatis, M. Roussopoulos, T.J. Giuli, D. S. H. Rosenthal, and M. Baker. The Lockss Peer-to-peer Digital Preservation System. ACM Trans. Comput. Syst., 23(l):2-50, 2005.
36. K. Walsh and E. Sirer. Experience with an Object Reputation System for Peer-to-peer Filesharing. In NSDP06: Proceedings of the 3rd conference on 3rd Symposium on Networked Systems Design & Implementation, pages 1-1, Berkeley, CA, USA, 2006. USENIX Association.
37. K. Walsh and E. Sirer. Fighting peer-to-peer Spam and Decoys with Object Reputation. In P2PECON '05: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 138-143, New York, NY, USA, 2005. ACM.