Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Communications of the ACM
Grapevine: an exercise in distributed computing
Communications of the ACM
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
Optimal Unconditional Information Diffusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scalable and Secure Resource Location
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
A Computational Model of Trust and Reputation for E-businesses
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
The LOCKSS peer-to-peer digital preservation system
ACM Transactions on Computer Systems (TOCS)
Distributed Computing
On the establishment of distinct identities in overlay networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Fighting peer-to-peer SPAM and decoys with object reputation
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Overcoming free-riding behavior in peer-to-peer systems
ACM SIGecom Exchanges
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Drinking from the firehose: multicast USENET news
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Experience with an object reputation system for peer-to-peer filesharing
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
On collaborative content distribution using multi-message gossip
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Human Flesh Search Model Incorporating Network Expansion and GOSSIP with Feedback
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Knowledge Aggregation in Human Flesh Search
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Stochastic coalescence in logarithmic time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Study of diffusion models in an academic social network
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
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.