Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, ...

Problems of cooperation are frequent among living organisms, but they difficult to solve. Humans have been able produce large-scale unrelated individuals through reputation systems. A challenging puzzle, however, is how can guide behavior if in most cases it not shared publicly and assigned others privately. We confirm that obtain agents playing the Prisoner’s Dilemma when reputations individua...

This paper gives drastically faster gossip algorithms to compute exact and approximate quantiles. Gossip algorithms, which allow each node to contact a uniformly random other node in each round, have been intensely studied and been adopted in many applications due to their fast convergence and their robustness to failures. Kempe et al. [KDG03, FOCS’03] gave gossip algorithms to compute importan...

During recent years, there has been a rapid growth in deployment of gossip-based protocol in many multicast applications. In a typical gossip-based protocol, each node acts as dual roles of receiver and sender, independently exchanging data with its neighbors to facilitate scalability and resilience. However, most of previous work in this literature seldom considered cheating issue of end users...

Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting of events to a subset of processes in a group only, potentially varying for every event, has not been considered. We ...

Gossip is a well-known technique for distributed computing in an arbitrarily connected network, that can be adopted effectively in wireless sensor networks. Gossip algorithms have been widely studied in previous literature, but mostly from a theoretical point of view. The aim of this paper is to verify the behavior of the gossip approach in practical scenarios, through the analysis and interpre...

Gossip-based protocols are simple, robust and scalable and have been consistently applied in many distributed, mostly wired, settings. Most validation in this area has been so far empirical and there is a clear lack of a theoretical counterpart clearly defining what can and cannot be computed with gossip-based protocols. Population protocols, on the other hand, provide a clear and formal model ...

Supported by meta-analytic evidence, the general consensus in teams literature is that more a team communicates, better. However, one type of communication appears at odds with this view gossip—a behavior traditionally viewed as harmful organizations. We propose way to uncover potential benefits gossip focus on valence (positive or negative nature) gossip. Drawing expectancy theory, we indirect...

The spreading of reputational information about group members through gossip represents a widespread, efficient, and low-cost form of punishment. Research shows that negative arousal states motivate individuals to gossip about the transgressions of group members. By sharing information in this way groups are better able to promote cooperation and maintain social control and order.

Formalisms for representing gossip problems are surveyed. A new method \calling schemes" is presented which generalizes existing methods. This survey is intended to serve primarily as a basis for future work.