The problems of gossiping and broadcasting have been widely studied. The basic gossip problem is defined as follows: there are n individuals, with each individual having an item of gossip. The goal is to communicate each item of gossip to every other individual. Communication typically proceeds in rounds, with the objective of minimizing the number of rounds. One popular model, called the telep...

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges very slowly. A recently proposed algorithm ...

This paper examines the study of gossip (godsib being the classical term) in human communities. In particular, we compare and contrast the study of gossip in the humanities and compare it with the development of gossip techniques as communication primitives in computer science. Distributed computer systems designers have developed various gossip based techniques for efficient communication and ...

Gossip, protocols have emerged to serve as building blocks to applications with high reliability requirements. However, a generic gossip solution may not be sufficient to ensure competitive performance in specific topologies such as in datacenter networks. This work addresses the problem of optimizing gossip-based protocols for use in datacenters. It starts by making a survey of different techn...

Cooperation can be supported by indirect reciprocity via reputation. Thanks to gossip, reputations are built and circulated and humans can identify defectors and ostracise them. However, the evolutionary stability of gossip is allegedly undermined by the fact that it is more error-prone that direct observation, whereas ostracism could be ineffective if the partner selection mechanism is not rob...

A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. We consider distributed gossip protocols wherein the agents themselves instead of a global scheduler determine whom to call. In this paper the problem of designing and analyzing gossip protocols is given a dynamic twist by assuming that when a call is established not only secrets are exchan...

Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial view of the global system. Because of the size of these networks, analysis of gossip protocols is mostly done using simulations, but even they tend to be expensive in computation time and memory consumption. We employ m...

Based on existing reliable broadcast protocols in MANETs, we propose a novel reliable broadcast protocol that uses clustering technique and gossip methodology. We combine local retransmission and gossip mechanisms to provide reliability in MANETs. The proposed protocol can dynamically change system parameters for reliable broadcast communication in order to improve the adaptability in the rapid...

This paper describes a self-learning software agent who collects and learns knowledge from the web and also exchanges her knowledge via dialogues with the users. The agent is built on top of information extraction, web mining, question answering and dialogue system technologies, and users can freely formulate their questions within the gossip domain and obtain the answers in multiple ways: text...

Recently, gossip algorithms have received much attention from the wireless sensor network community due to their simplicity, scalability and robustness. Motivated by applications such as compression and distributed transform coding, we propose a new gossip algorithm called Selective Gossip. Unlike the traditional randomized gossip which computes the average of scalar values, we run gossip algor...