Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distributed systems are usually heterogeneous with respect to network capabilities such as bandwidth. In practice, a blind load-balancing strategy migh...

Gossip in the workplace has generally been ignored by researchers and often criticized by practitioners. The authors apply a transdisciplinary evolutionary approach to argue that gossip is a natural part of social organizations and that certain conditions can encourage socially-redeeming gossip. They draw on case studies involving cattle ranchers, members of a competitive rowing team, and airli...

P2P networks are becoming increasingly used for wide-scale collaborative information spreading over the Internet. Thus, the ability to share information with large group of network nodes at near-optimal cost may be the one step that will allow P2P networks to replace traditional broadcast. For large groups, there are substantial inefficiencies that result from using deterministic tree-based app...

The gossip mechanism could support reliable and scalable communication in large-scale settings. In large-scale peer-to-peer environment, however, each node could only have partial knowledge of the group membership. More seriously, because the node has no global knowledge about the underlying topology, gossip mechanism incurs much unnecessary network overhead on the Internet. In this paper, we p...

Gossip is a subject that has been studied by researchers from an array of disciplines with various foci and methods. We measured the content of language use by members of a competitive sports team across 18 months, integrating qualitative ethnographic methods with quantitative sampling and analysis. We hypothesized that the use of gossip will vary significantly depending on whether it is used f...

College students ranked the interest value of 12 different gossip scenarios; likelihood of spreading the gossip; and the people to whom they would be most likely to tell the gossip, depending on whether the gossip was about male or female professors, relatives, friends, acquaintances, strangers, or a same-sex rival or a romantic partner. Damaging, negative news about rivals and positive news ab...

Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip protocols in the context of wireless sensor networks. We adopt a simple probabilistic timed process calculus for modellingwireless sensor networks. We equip ...

The design of efficient gossip-based protocols for computing aggregate functions in wireless sensor network has received considerable attention recently. A primary reason for this surge in interest is their robustness due to their randomized nature. In addition, because of the inherent simplicity in their design, gossip-based protocols are suitable to be implemented on sensor nodes with limited...

Distributed gossip algorithm has been studied in literature for practical implementation of the distributed consensus algorithm as a fundamental algorithm for the purpose of in-network collaborative processing. This paper focuses on optimizing the convergence rate of the gossip algorithm for both classical and quantum networks. A novel model of the gossip algorithm with non-uniform clock distri...

Gossip can promote cooperation via reputational concern. However, the relative effectiveness of positive and negative gossip in fostering prosociality has not been examined. The present study explored influence on prosocial behavior, using an economic game. Supporting previous evidence, it was found that individuals were more when any kind possible, compared to their behavior completely anonymo...