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

Real life networks are generally modelled as scale-free networks. Information diffusion in such networks in decentralised environment is a difficult and resource consuming affair. Gossip algorithms have come up as a good solution to this problem. In this paper, we have proposed Adaptive First-Push-Then-Pull gossip algorithm. We show that algorithm works with minimum cost when the transition rou...

This paper studies a decentralized, randomized gossip algorithm for computing a majority vote amongst the binary decisions associated to n nodes organized in a fixed, ad-hoc network. It is indicated how this problem can be reduced to computing the global average using a standard, randomized gossip algorithm. Then, we illustrate how the majority vote problem allows one to formulate individual st...

HUANG, YUFAN. Gossip-based Information Spreading in Mobile and Social Networks. (Under the direction of Dr. Huaiyu Dai.) We study the performance of gossip-based information spreading in different network models. Our study is conducted in two major different circumstances: mobile networks and social networks. In mobile networks, we mainly study two problems: single-piece information spreading w...

We provide a generic achievability argument for incentives in gossip based p2p streaming by proving that after coupling a randomized optimistic unchoke mechanism to an incentive based gossip streaming algorithm we can (still) distribute a stream from one source to n peers in O(log n) time with high probability. We provide simulation results for a distributed incentive scheme for gossip based p2...

The communication modes (one-way and two-way mode) used for disseminating information among processors of interconnection networks via vertex-disjoint paths in one communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Since optimal broadcast and accumulation algorithms for these modes can be achieved in a strai...

The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip p...

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

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

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