In this work we present a new framework for the analysis and design of randomized gossip algorithms solving average consensus problem. We show how classical iterative methods linear systems can be interpreted as when applied to special encoding underlying network explain in detail their decentralized nature. Our general recovers comprehensive array well-known cases, including pairwise algorithm...

We introduce a framework that can model different kinds of epistemic gossip problems. We also formalize some parameters that distinguish the different types of gossip problem. Finally, we present a few results that show the effect of the parameters.

Gossip protocols have proved to be a viable solution to setup and manage large-scale 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...

Motivated by the large expansion in the study of social networks, this paper deals with the problem of multiple messages spreading over the same network using gossip algorithms. Given two messages distributed over some nodes of the graph, we first investigate the final distribution of the messages given an initial state. Then, an algorithm is presented to achieve consensus over one of the messa...

In this paper we show that gossip algorithms may be effectively used to disseminate game events in Peer-to-Peer (P2P) Multiplayer Online Games (MOGs). Game events are disseminated through an overlay network. The proposed scheme exploits the typical behavior of players to tune the data dissemination. In fact, it is well known that users playing a MOG typically generate game events at a rate that...

Gr oup-based reliable multicast is an important building block for distributed applications. For large systems, however, traditional appr oaches do not scale well due to centr alize drecovery mechanisms and excessive message overhead. In this paper, we present a reliable probabilistic multicast, rpbcast, that is a hybrid of the centr alize dand gossip-b ased approaches. In p articular,rpbcast e...

In this project we look at the effects of gossip spread on social network structure. We define gossip as information passed between two individuals A and B about an individual C who is not present, which has the potential to affect the strengths of all three relationships A-B, B-C, and A-C. This work is novel in two respects: first, there is no theoretical work on how network structure changes ...

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....