We develop an analytical model of information dissemination for a gossiping protocol that combines both pull and push approaches. With this model we analyse how fast an item is replicated through a network, and how fast the item spreads in the network, and how fast the item covers the network. We also determine the optimal size of the exchange buffer, to obtain fast replication. Our results are...

Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other secrets. Recently a number of authors studied distributed epistemic gossip protocols. These protocols use as guards formulas from a simple epistemic logic, which makes their analysis and verification substantially easier. We study here common knowledge in ...

We present algorithms for identifying frequently occurring elements in a large distributed data set using gossip. Our algorithms do not rely on any central control, or on an underlying network structure, such as a spanning tree. Instead, nodes repeatedly select a random partner and exchange data with the partner – if this process continues for a (short) period of time, the desired results are c...

We present in this paper a general garbage collection scheme that reduces the “noise” in gossip-based broadcast algorithms. In short, our garbage collection scheme uses a simple heuristic to trade “useless” messages with “useful” ones. Used with a given gossip-based broadcast algorithm, a given size of buffers, and a given number of disseminated messages (e.g., per gossip round), our garbage co...

Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of gossip-based membership protocols were proposed. Some were shown to be effective empirically, lacking analytic understanding of their properties. Others were analyzed under simplifying assumptions, such as lossless an...

The traditional Gossip protocol selects the neighbor nodes randomly. It does not consider the factors, such as the capacities of network transmission and node storage, which affect the network performance. It further causes the drawback of successful search ratio relatively lower, and also network transmission payloads have the characteristics of randomness. In this paper, to overcome those dra...

Gossip-based techniques recently adopted in mobile ad hoc network (MANET) system have achieved significant improvement on network overhead, routing efficiency and reliability. In this paper we investigate an up-to-date gossip-based Ad Hoc routing algorithm (AODV+G) [2] implemented in Ad Hoc On-Demand Distance Vector Routing (AODV) and discuss its weakness with respect to overall network routing...

Conversation is a uniquely human phenomenon. Analyses of freely forming conversations indicate that approximately two thirds of conversation time is devoted to social topics, most of which can be given the generic label gossip. This article first explores the origins of gossip as a mechanism for bonding social groups, tracing these origins back to social grooming among primates. It then asks wh...

Gossip protocols deal with a group of communicating agents, each holding a private information, and aim at arriving at a situation in which all the agents know each other secrets. Distributed epistemic gossip protocols are particularly simple distributed programs that use formulas from an epistemic logic. Recently, the implementability of these distributed protocols was established (which means...

Although preliminary research implies a tantalizing association between workplace gossip and interpersonal relationships, little is known about how shapes relationships at work. Given that are integral to employee wellbeing the development of social capital, it appears vital develop more comprehensive understanding psychological processes linking relationships. To this end, we induce theory fro...