We study the stopping times of gossip algorithms fornetwork coding. We analyze algebraic gossip (i.e., random linearcoding) and consider three gossip algorithms for informationspreading: Pull, Push, and Exchange. The stopping time ofalgebraic gossip is known to be linear for the complete graph, butthe question of determining a tight upper bound or lower boundsfor general...

The gossip problem (telephone problem) is an information dissemination problem in which each of n nodes of a communication network has a unique piece of information that must be transmitted to all the other nodes using two-way communications (telephone calls) between the pairs of nodes. During a call between the given two nodes, they exchange the whole information known to them at that moment. ...

Gossip protocols are communication protocols in which, periodically, every node of a network exchanges information with some other node chosen according to some (randomized) strategy. These protocols have recently found various types of applications for the management of distributed systems. Spatial gossip protocols are gossip protocols that use the underlying spatial structure of the network, ...

In this paper we discuss the viability of deploying Multiplayer Online Games (MOGs) over scale-free networks. We employ a general peer-to-peer overlay network; nodes have a number of neighbors which follows a power law distribution, pk ∼ k , the usual degree distribution that characterizes scale-free nets. Game events generated by nodes during the game evolution are disseminated through the net...

This paper empirically explores relations between network positions in knowledge networks and trust. In social network theory the closure argument and the gossip argument describe this relation. These two arguments do not distinguish between different dimensions of trust. In this paper we estimate effects of closure positions on two dimensions of trust (trust in abilities and trust in intention...

In order to successfully monitor a large-scale distributed system, it is an important issue that the monitoring function fully covers all the entities in the system. To this end, a key challenge is to efficiently transmit state information of the entities in the system. This paper solves this challenge from two aspects. First, in virtue of the idea of self-organizing networks, this paper propos...

Over the last decade, we have seen a revolution in connectivity between computers, and a resulting paradigm shift from centralized to highly distributed systems. With massive scale also comes massive instability, as node and link failures become the norm rather than the exception. For such highly volatile systems, decentralized gossip-based protocols are emerging as an approach to maintaining s...

Gossip is universal, and multiple studies have demonstrated that it can beneficial group-level outcomes when negative reports help identify defectors or norm-violators. Gossip, however, seldom happens in a social vacuum. Instead, enmeshed fabric of positive relationships creates opportunities, constraints, also motives to gossip. This article the importance friendships antipathies among three c...