Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all other nodes using two-way communications between pairs of nodes along the communication links of the network. In this paper, we study gossiping using a linear cost model of communication which includes a start-up time and a propagation...

Gossip protocols are simple, robust and scalable and have been consistently applied to many (mostly wired) distributed systems. Nevertheless, most validation in this area has been empirical so far and there is a lack of a theoretical counterpart to characterize what can and cannot be computed with gossip protocols. Population protocols, on the other hand, benefit from a sound theoretical framew...

Prior theory suggests that reputation spreading (e.g., gossip) and punishment are two key mechanisms to promote cooperation in groups, but no behavioral research has yet examined their relative effectiveness and efficiency in promoting and maintaining cooperation. To examine these issues, we observed participants interacting in a four-round public goods game (PGG) with or without gossip and pun...

Gossip is defined as a rumor which specifically targets one individual and essentially only propagates within its friendship connections. How fast and how far a gossip can spread is for the first time assessed quantitatively in this study. For that purpose we introduce the “spread factor” and study it on empirical networks of school friendships as well as on various models for social connection...

Information Communication Technology (ICT) contributes effectively to spreading of all sorts of information, including gossip and rumors. The continuous growth of online communications calls thus for analysis of their mechanisms and consequences, as moral responsibility increases with increasing information. Taking the Information Ethics (IE) perspective we discuss gossip and its role in social...

Ad hoc and sensor networks usually do not have a central entity for managing information spreading. Moreover, such wireless stations have limited energy and computational power. All this leads to a need for distributed and efficient algorithms for disseminating information across the network. Network coding in conjunction with random walks and gossip techniques proposes a local and distributed ...

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