Yaacov Fernandess
ABSTRACT
This paper introduces and analyzes a variant of distributed gossip which is motivated by the sharing of recommendations in a social network. The social settings bear two implications on gossip. First, rumors fade after a few hops, and so does our gossip mechanism. Second, users require a rumor to be substantiated by multiple, independent sources in order to adopt it. Consequently, in our social gossip a message is adopted only when it is received over a threshold of independent paths. Social gossip is a new, highly relevant and practically motivated variant of distributed gossip, whose analysis contributes to the fundamental theory of distributed algorithms.
- Nocturnal. http://research.microsoft.com/research/sv/Nocturnal/.Google Scholar
- . 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. Google ScholarDigital Library
- . M. Minsky and F. B. Schneider. Tolerating Malicious Gossip. Distributed Computing, 16(1):49--68, 2003. Google ScholarDigital Library
- . Malkhi, E. Pavlov, and Y. Sella. Optimal Unconditional Information Diffusion. In Proceedings of the 15th International Symposium on DIStributed Computing, 2001. Google ScholarDigital Library
- . Malkhi, M. K. Reiter, O. Rodeh, and Y. Sella. Efficient Update Diffusion in Byzantine Environments. In Proceedings of the 20th IEEE Symposium on Reliable Distributed Systems, Washington, DC, USA, 2001. IEEE Computer Society.Google Scholar
- . 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 ACM Symposium on Principles of distributed computing, pages 1--12, New York, NY, USA, 1987. ACM Press. Google ScholarDigital Library
- . J. Watts and S. H. Strogatz. Collective dynamics of Şsmall-worldŤ networks. Nature, pages 440--442, 1998.Google Scholar
- . Kleinberg. The Small-world Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000. Google ScholarDigital Library
- . D. Flaxman. Expansion and Lack Thereof in Randomly Perturbed Graphs. Technical report, 2006. Manuscript under submission.Google Scholar
- . Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip Algorithms: Design, Analysis and Applications. In Proceedings of IEEE INFOCOM, 2005.Google Scholar
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . Haas, J. Y. Halpern, and L. Li. Gossip-based ad hoc Routing. In Proceedings of IEEE INFOCOM, June 2002.Google Scholar
- . van Renesse, Y. Minsky, and M. Hayden. A Gossip-style Failure Detection Service. In Proceedings of Middleware, 1998. Google ScholarDigital Library
- .van Renesse. Scalable and Secure Resource Location. In Proceedings of IEEE Hawaii International Conference on System Sciences, January 2000. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . J. Ganesh, A. Kermarrec, and L. Massoulié. Peer-to-peer Membership Management for Gossip-based Protocols. IEEE Transactions on Computers, 52(2), February 2003. Google ScholarDigital Library
- . Voulgaris, D. Gavidia, and M. van Steen. Cyclon: Inexpensive Membership Management for Unstructured p2p overlays. J. Network Syst. Manage., 13(2), 2005.Google Scholar
- . Guerraoui, S. B. Handurukande, and A.-M. Kermarrec. GosSkip: a Gossip-based Structured Overlay Network for Efficient Content-based Filtering. Technical report, 2004.Google Scholar
- . Fernandess and D. Malkhi. On Collaborative Content Distribution using Multi-message Gossip. In IPDPS: IEEE International Parallel and Distributed Processing Symposium. IEEE, April 2006. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . Feldman and J. Chuang. Overcoming Free-riding Behavior in Peer-to-peer Systems. SIGecom Exch., 5(4):41--50, 2005. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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.Google Scholar
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman. Reputation Systems. Commun. ACM, 43(12):45--48, 2000. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
- . 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(1):2--50, 2005. Google ScholarDigital Library
- . Walsh and E. Sirer. Experience with an Object Reputation System for Peer-to-peer Filesharing. In NSDI'06: Proceedings of the 3rd conference on 3rd Symposium on Networked Systems Design & Implementation, pages 1--1, Berkeley, CA, USA, 2006. USENIX Association. Google ScholarDigital Library
- . 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. Google ScholarDigital Library
Index Terms
- On spreading recommendations via social gossip
Recommendations
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
Special issue on networking and information theoryThe problem of simultaneously disseminating k messages in a large network of n nodes, in a decentralized and distributed manner, where nodes only have knowledge about their own contents, is studied. In every discrete time-step, each node selects a ...
On collaborative content distribution using multi-message gossip
We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes. Here we explore the inter-operation ...
An efficient gossip based overlay network for peer-to-peer networks
ICUFN'09: Proceedings of the first international conference on Ubiquitous and future networksOverlay networks have emerged as a means to enhance end-to-end application performance and availability. Network topology plays an important role in utilizing resources in Peer-to-peer systems. Epidemic algorithms are potentially effective solutions for ...
Comments