The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, importance ranking to support search, and virtual coordinate systems to facilitate managing network proximity. Robust and efficient asynchronous distributed algorithms are known only for the case when the dominant eigenv...

We study oblivious deterministic gossip algorithms for multi-channel radio networks with a malicious adversary. In a multi-channel network, each of the n processes in the system must choose, in each round, one of the c channels of the system on which to participate. Assuming the adversary can disrupt one channel per round, preventing communication on that channel, we establish a tight bound of ...

We present algorithms for identifying frequently occurring items in a large distributed data set. Our algorithms use gossip as the underlying communication mechanism, and do not rely on any central control, nor on an underlying network structure, such as a spanning tree. Instead, nodes repeatedly select a random partner and exchange data with that partner. If this process continues for a (short...

Motivated by applications to modern networking technologies, there has been interest in designing efficient gossip-based protocols for computing aggregate functions. While gossip-based protocols provide robustness due to their randomized nature, reducing the message and time complexity of these protocols is also of paramount importance in the context of resource-constrained networks such as sen...

In this paper we present a solution to thèLatest Gossip Problem' for a shared memory distributed system. The Latest Gossip Problem is essentially one of bounded timestamping in which processes must locally keep track of thèlatest' information, direct or indirect, about all other processes. A solution to the Latest Gossip Problem is fundamental to the understanding of information ow in a distrib...

Broadcasting and gossiping are fundamental communication tasks in networks. In broadcasting, one node of a network has a message that must be learned by all other nodes. In gossiping, every node has a (possibly different) message, and all messages must be learned by all nodes. We study these well-researched tasks in a very weak communication model, called the beeping model. Communication procee...

We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k tokens to all nodes. The goal is to accomplish the task in as few rounds of distributed computation as possible. The problem is ...

In periodic gossip schemes, the calls are periodically repeated according to a proper coloring of the edges of the underlying graph with integers 1; 2;. .. ; c. One period consists of c consecutive rounds 1;. .. ; c each containing time-parallel bidirectional calls on all edges with the same color. The problem is to design colorings which minimize the number of periods until gossiping is comple...