We study the problem of all-to-all information exchange, also known as gossip, in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, there are n tokens arbitrarily distributed among the n network nodes, and the goal is to disseminate all the n tokens to every node. O...

We present Brahms, an algorithm for sampling random nodes in a large dynamic systemprone to Byzantine failures. Brahms stores small membership views at each node, and yetovercomes Byzantine failures of a linear portion of the system. Brahms is composed of twocomponents. The first one is a Byzantine-resistant gossip-based membership protocol. Thesecond one uses a novel memory...

Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes randomly select their neighbors to form an unstructured overlay mesh (gossip-style overlay construction) and then each node requests desired data blocks from its neighbors (block scheduling). To improve the performance, mo...

Structured overlay networks have recently received much attention due to their self-* properties under dynamic and decentralized settings. The number of nodes in an overlay fluctuates all the time due to churn. Since knowledge of the size of the overlay is a core requirement for many systems, estimating the size in a decentralized manner is a challenge taken up by recent research activities. Go...

Gossip-based protocols are very robust and are able to distribute the load uniformly among all processes. Furthermore, gossip-protocols circumvent the oscillatory phenomena that are known to occur with other forms of reliable multicast. As a result, they are excellent candidates to support the dissemination of information in large-scale datacenters. However, in this context, topology oblivious ...

Gossip protocols have been shown to be a useful tool in the development of simple, robust, and efficient distributed systems. This thesis addresses a number of problems associated with gossip protocols, including dealing with the failure of a large fraction of the hosts in a system, accommodating the topology of the underlying network, improving the efficiency of information exchange between ho...

Gossip based multicast is a scalable and reliable protocol for dissemination of information within a group of interconnected users. Upon receiving or producing a message the process sends (pushes) it to a small constant subset of processes which is randomly selected out of the group of members. Some implementations of gossip based multicasts poll a small subset of processes for new information,...

This paper presents an asynchronous gossip-based algorithm for finding aNash equilibrium (NE) of a game in a distributedmulti-player network. The algorithm is designed in such away that playersmake decisions based on estimates of the other players’ actions obtained from local neighbors. Using a set of standard assumptions on the cost functions and communication graph, the paper proves almost su...

This paper presents performance-oriented refinements and distributed implementation of a reconfigurable linearizable data service for read/write atomic objects. This service is based on the work of Lynch and Shvartsman, and it guarantees consistency under dynamic conditions involving asynchrony, message loss, and node arrivals, departures, and failures. To achieve fault tolerance and availabili...

The main contribution of this paper is a novel distributed algorithm based on asynchronous and randomized local interactions, i.e., gossip based, for task assignment on heterogeneous networks. We consider a set of tasks with heterogeneous cost to be assigned to a set of nodes with heterogeneous execution speed and interconnected by a network with unknown topology represented by an undirected gr...