Gossip is pervasive at the workplace, yet receives scant attention in sensemaking literature and stands on periphery of organization studies. We seek to reveal non-triviality gossip processes sensemaking. In drawing empirical data from an observational study a British Media firm, we adopt processual perspective showing how people produce, understand, enact their sense what occurring through as ...

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

Radio networks model wireless synchronous communication with only one wave frequency used for transmissions. In the problem of many-to-all (M2A) communication, some nodes hold input rumors, and the goal is to have all nodes learn all the rumors. We study the average time complexity of distributed many-to-all communication by deterministic protocols in directed networks under two scenarios: of c...

A blockchain is an append-only sequence of blocks of arbitrary data. The two most popular approaches to blockchains are permissionless blockchains based on Proof of Work (PoW) and permissioned blockchains based on Byzantine consensus or Byzantine Fault Tolerance (BFT). The first is based on competitions between anonymous participants solving cryptopuzzles, while the latter is a cooperative appr...

We introduce a technique for accelerating the gossip algorithm of Boyd et. al. (INFOCOM 2005) for distributed averaging in a network. By employing memory in the form of a small shift-register in the computation at each node, we can speed up the algorithm’s convergence by a factor of 10. Our accelerated algorithm is inspired by the observation that the original gossip algorithm is analogous to t...

Cím: A comparative study of spanning tree and gossip protocols for aggregation

This paper focuses on monitoring the state of the nodes in a wireless sensor network where the nodes are unaware of the location of the monitoring node. We introduce an epidemic protocol designed to propagate the state of the nodes in a simple, yet effective manner. The nodes in the network communicate their state through local interaction with their neighbors. The monitoring of the network is ...

Gossiping is the process of information diiusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of blocks during each call. We study the minimum number of calls necessary to perform gossipi...

Most existing communications technologies are either not scalable at all, or scale only under carefully controlled conditions. This threatens an emerging generation of mission-critical but very large computing systems, which will need communication support for such purposes as system management and control, policy administration, data dissemination, and to initiate adaptation in demanding envir...

In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial st...