To complement views of gossip as essentially a means of gaining information about individuals, cementing social bonds, and engaging in indirect aggression, the authors propose that gossip serves to help people learn about how to live in their cultural society. Gossip anecdotes communicate rules in narrative form, such as by describing how someone else came to grief by violating social norms. Go...

This paper provides an extensive experimental evaluation of the gossip technique that has been proposed to construct scalable and reliable multicast protocols. This evaluation has been done by simulating several gossip and non gossip-based multicast protocols in a network simulator NS2. The evaluation comprises of three parts: (1) a comparison of the gossip technique with other traditional mess...

This paper presents a novel adaptation mechanism that allows every node of a gossip-based broadcast algorithm to adjust the rate of message emission 1) to the amount of resources available to the nodes within the same broadcast group and 2) to the global level of congestion in the system. The adaptation mechanism can be applied to all gossip-based broadcast algorithms we know of and makes their...

We present a model checking algorithm for LCSA, a temporal logic for communicating sequential agents (CSAs) introduced by Lodaya, Ramanujam, and Thiagarajan. LCSA contains temporal modalities indexed with a local point of view of one agent and allows to refer to properties of other agents according to the latest gossip which is related to local knowledge. The model checking procedure relies on ...

We introduce models of gossip based communication networks in which each node is simultaneously a sensor, a relay and a user of information. We model the status of ages of information between nodes as a discrete time Markov chain. In this setting a gossip transmission policy is a decision made at each node regarding what type of information to relay at any given time (if any). When transmission...

The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Random walks are a fundamental primitive in a wide variety of network applications; the local and lightweight nature of random walks is especially useful for providing uniform and efficient solutions to distributed control of dynamic networks. Giv...

We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is no designated fusion center; instead sensors exchange messages on the associated communication graph to obtain a global estimate. We propose an asynchronous distributed algorithm based on local fusion between neighbo...

Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in (received) message overheads at different nodes. This paper presents techniques that leverages simple social networks principles to enable nodes to select gossip targets intelligently. These simple heuristics achieve a more uniform message overhead at each node, while ...