Slicing a distributed system involves partitioning the nodes into k equal-size subsets using a onedimensional attribute. A new gossip-based slicing algorithm that we call Sliver is proposed here; relative to alternatives, it converges more rapidly to an accurate solution and does a better job of tolerating churn. The low cost and simplicity of the solution makes it appropriate for use in a wide...

We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Gossip which employs a hierarchical decomposition of the graph to partition the computation into tractable sub-problems. Using only pairwise messages of fixed size that travel at most O(n 1 3 ) hops, our algorithm is robust and h...

In this paper, we present a distributed particle filter (DPF) for target tracking in a sensor network. The proposed DPF consists of two major steps. First, particle compression based on support vector machine is performed to reduce the cost of transmission among sensors. Second, each sensor fuses the compressed information from its neighboring nodes with use of consensus or gossip algorithm to ...

This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties, finding four different probabilistic generalizations of classical consensus states. We then extend the gossip consensus algorithm to the quantum setting and...

Although person perception is central to virtually all human social behavior, it is ordinarily studied in isolated individual perceivers. Conceptualizing it as a socially distributed process opens up a variety of novel issues, which have been addressed in scattered literatures mostly outside of social psychology. This article examines some of these issues using a series of multiagent models. Pe...

Distributed Gossip in networks is a well studied and observed problem which can be accomplished using different gossiping styles. This work focusses on the development, analysis and evaluation of a novel in-situ distributed gossip protocol framework design called (INDIGO). A core aspect of INDIGO is its ability to execute on a simulation setup as well as a system testbed setup in a seamless man...

The main part of gossip schemes are the kernels of their minimal orders. We give a complete characterization of all kernels that may appear in gossip schemes on simple graphs with a minimum number of calls. As consequences we prove several results on gossip schemes, e.g. the minimum number of rounds of a gossip scheme with a minimum number of calls is computed. Moreover, in the new context we g...

Group-based reliable multicast is an important building block for distributed applications. For large systems, however, traditional approaches do not scale well due to centralized recovery mechanisms and excessive message overhead. In this paper, we present a reliable probabilistic multicast, rpbcast, that is a hybrid of the centralized and gossip-based approaches. In particular, rpbcast extend...

We review cross-disciplinary research on gossip and integrate it with two streams of theoretical scholarship: paradox theory the communicative constitution organization (CCO) perspective. In doing so, we develop what label a paradox-constitutive perspective organizational gossip. Our holds that does not merely reflect or reveal paradoxes but contributes to constituting them. Drawing an extensiv...