An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

Evolutionary models of human cooperation are increasingly emphasizing the role of reputation and the requisite truthful "gossiping" about reputation-relevant behavior. If resources were allocated among individuals according to their reputations, competition for resources via competition for "good" reputations would have created incentives for exaggerated or deceptive gossip about oneself and on...

To complement views of gossip as essentially a means of gaining information about individuals, cementing social bonds, and engaging in indirect aggression, the authors propose that gossip serves to help people learn about how to live in their cultural society. Gossip anecdotes communicate rules in narrative form, such as by describing how someone else came to grief by violating social norms. Go...

This paper provides an extensive experimental evaluation of the gossip technique that has been proposed to construct scalable and reliable multicast protocols. This evaluation has been done by simulating several gossip and non gossip-based multicast protocols in a network simulator NS2. The evaluation comprises of three parts: (1) a comparison of the gossip technique with other traditional mess...

The objective of the rendezvous problem is to construct a method that enables a population of agents to agree on a spatial (and possibly temporal) meeting location. We introduce the buffered gossip algorithm as a general solution to the rendezvous problem in a discrete domain with direct communication between decentralized agents. We compare the performance of the buffered gossip algorithm agai...

Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in (received) message overheads at different nodes. This paper presents techniques that leverages simple social networks principles to enable nodes to select gossip targets intelligently. These simple heuristics achieve a more uniform message overhead at each node, while ...

Gossip based multicast can be an e ective tool for providing highly reliable and scalable message dis semination Previous work has shown it to be useful in a variety of group communication settings when processes all belong to a single process group In this paper we consider the problem of gossiping within overlapping process subgroups If each subgroup independently runs the standard gossip pro...

Workplace gossip is a ubiquitous phenomenon around the world: research on organizations in both the United States and Western Europe suggests that over 90% of the workforce engages in at least some gossip activity on the job (Gosser et al., 2012). Organizational literature has paid little attention to gossip and, perhaps because of its complexity, management research surrounding gossip is scant...

Gossip is informal talking about colleagues. Taking a social network perspective, we argue that group boundaries and social status in the informal workplace network determine who the objects of positive and negative gossip are. Gossip networks were collected among 36 employees in a public child care organization, and analyzed using exponential random graph modeling (ERGM). As hypothesized, both...