A half century of gossip research from multiple disciplines is reviewed. Discussed are definitions of the construct; social, evolutionary, and personal functions of the practice; and data collection methods. Though people engage in the practice frequently, there has been relatively little psychological research on gossip. The layperson’s understanding of the term is included in, but insufficien...

In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise underlying distributed gossip is very simple: in each time step, each node in the system selects some other node as a communication partner — generally by a simple randomized rule — and exchanges information with ; ove...

Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HEterogeneity-Aware Gossip Protocol, where nodes dynamically adjust their contribution to gossip dissemination according to their capabilities....

Although person perception is central to virtually all human social behavior, it is ordinarily studied in isolated individual perceivers. Conceptualizing it as a socially distributed process opens up a variety of novel issues, which have been addressed in scattered literatures mostly outside of social psychology. This article examines some of these issues using a series of multiagent models. Pe...

Distributed Gossip in networks is a well studied and observed problem which can be accomplished using different gossiping styles. This work focusses on the development, analysis and evaluation of a novel in-situ distributed gossip protocol framework design called (INDIGO). A core aspect of INDIGO is its ability to execute on a simulation setup as well as a system testbed setup in a seamless man...

The main part of gossip schemes are the kernels of their minimal orders. We give a complete characterization of all kernels that may appear in gossip schemes on simple graphs with a minimum number of calls. As consequences we prove several results on gossip schemes, e.g. the minimum number of rounds of a gossip scheme with a minimum number of calls is computed. Moreover, in the new context we g...

Group-based reliable multicast is an important building block for distributed applications. For large systems, however, traditional approaches do not scale well due to centralized recovery mechanisms and excessive message overhead. In this paper, we present a reliable probabilistic multicast, rpbcast, that is a hybrid of the centralized and gossip-based approaches. In particular, rpbcast extend...

We review cross-disciplinary research on gossip and integrate it with two streams of theoretical scholarship: paradox theory the communicative constitution organization (CCO) perspective. In doing so, we develop what label a paradox-constitutive perspective organizational gossip. Our holds that does not merely reflect or reveal paradoxes but contributes to constituting them. Drawing an extensiv...

Gossip protocols have proved to be a viable solution to set-up and manage largescale P2P services or applications in a fully decentralised scenario. The gossip or epidemic communication scheme is heavily based on stochastic behaviors and it is the fundamental idea behind many large-scale P2P protocols. It provides many remarkable features, such as scalability, robustness to failures, emergent l...