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...

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...

This paper presents a novel approach to a self-learning agent who collects and learns new knowledge from the web and exchanges her knowledge via dialogues with the users. The application domain is gossip about celebrities in the music world. The agent can inform herself and update the acquired knowledge by observing the web. Fans of musicians can ask for gossip information about stars, bands or...

Gossip is pervasive at the workplace, yet receives scant attention in sensemaking literature and stands on periphery of organization studies. We seek to reveal non-triviality gossip processes sensemaking. In drawing empirical data from an observational study a British Media firm, we adopt processual perspective showing how people produce, understand, enact their sense what occurring through as ...

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...